messages listlengths 2 2 |
|---|
[
{
"role": "user",
"content": "Complete this F* function with a correct proof.\n\nType: \n head: FStar.Tactics.NamedView.term ->\n arg_terms: Prims.list FStar.Tactics.NamedView.term ->\n hoisted_args: Prims.list FStar.Stubs.Reflection.V2.Data.argv\n -> FStar.Tactics.Effect.Tac FStar.Tactics.NamedVi... |
[
{
"role": "user",
"content": "Complete this F* function with a correct proof.\n\nType: mt: MerkleTree.Spec.merkle_tree n -> idx: Prims.nat{idx < Prims.pow2 n}\n -> Prims.GTot MerkleTree.Spec.padded_hash\nEffect: Prims.GTot\n\nContext:\nmodule MerkleTree.Spec\n\nopen FStar.Classical\nopen FStar.Mul\nopen FS... |
[
{
"role": "user",
"content": "Complete this F* function with a correct proof.\n\nType: \n name: FStar.Tactics.PatternMatching.varname ->\n pat: FStar.Tactics.PatternMatching.pattern ->\n hypotheses: Prims.list FStar.Tactics.PatternMatching.hypothesis ->\n body: (_: FStar.Tactics.PatternMatching.... |
[
{
"role": "user",
"content": "Complete this F* function with a correct proof.\n\nType: b: FStar.Tactics.NamedView.binder\n -> FStar.Tactics.Effect.Tac\n (FStar.Tactics.PatternMatching.abspat_binder_kind * FStar.Tactics.NamedView.term)\nEffect: FStar.Tactics.Effect.Tac\n\nContext:\n(*\n Copyright 2008-... |
[
{
"role": "user",
"content": "Complete this F* function with a correct proof.\n\nType: _: FStar.Tactics.PatternMatching.abspat_binder_kind -> Prims.string\nEffect: Prims.Tot\n\nContext:\n(*\n Copyright 2008-2018 Microsoft Research\n\n Licensed under the Apache License, Version 2.0 (the \"License\");\n ... |
[
{
"role": "user",
"content": "Complete this F* function with a correct proof.\n\nType: mt: MerkleTree.Spec.merkle_tree n -> Prims.GTot (MerkleTree.Spec.merkle_tree (n - 1))\nEffect: Prims.GTot\n\nContext:\nmodule MerkleTree.Spec\n\nopen FStar.Classical\nopen FStar.Mul\nopen FStar.Seq\n\nmodule S = FStar.Seq... |
[
{
"role": "user",
"content": "Complete this F* function with a correct proof.\n\nType: \n ws: Hacl.Spec.SHA2.Vec.ws_spec a m ->\n j: Prims.nat{j < Hacl.Spec.SHA2.Vec.lanes a m} ->\n i: Prims.nat{i < 16}\n -> FStar.Pervasives.Lemma\n (ensures\n (let l = Hacl.Spec.SHA2.Vec.lanes a m in\n ... |
[
{
"role": "user",
"content": "Complete this F* function with a correct proof.\n\nType: MerkleTree.Spec.hash_fun_t\nEffect: Prims.Tot\n\nContext:\nmodule MerkleTree.Spec\n\nopen FStar.Classical\nopen FStar.Mul\nopen FStar.Seq\n\nmodule S = FStar.Seq\n\n#set-options \"--max_fuel 0 --max_ifuel 0 --z3rlimit 10\... |
[
{
"role": "user",
"content": "Complete this F* function with a correct proof.\n\nType: GradedMonad.monoid Prims.nat\nEffect: Prims.Tot\n\nContext:\nmodule GradedMonad\n\n(* NB: this is the old version of the graded monad that has a monoid\nindex parameter everywhere instead of a constraint on the type. We\n... |
[
{
"role": "user",
"content": "Complete this F* function with a correct proof.\n\nType: mt: MerkleTree.Spec.merkle_tree n\n -> FStar.Pervasives.Lemma\n (ensures\n FStar.Seq.Base.equal (MerkleTree.Spec.mt_next_lv (MerkleTree.Spec.mt_right mt))\n (MerkleTree.Spec.mt_right (MerkleTree.Spec.mt_ne... |
[
{
"role": "user",
"content": "Complete this F* function with a correct proof.\n\nType: n: Prims.pos -> mt: MerkleTree.Spec.merkle_tree n -> nmt: MerkleTree.Spec.merkle_tree (n - 1)\n -> Prims.GTot Type0\nEffect: Prims.GTot\n\nContext:\nmodule MerkleTree.Spec\n\nopen FStar.Classical\nopen FStar.Mul\nopen FS... |
[
{
"role": "user",
"content": "Complete this F* function with a correct proof.\n\nType: mt: MerkleTree.Spec.merkle_tree n -> MerkleTree.Spec.merkle_tree (n - 1)\nEffect: Prims.Tot\n\nContext:\nmodule MerkleTree.Spec\n\nopen FStar.Classical\nopen FStar.Mul\nopen FStar.Seq\n\nmodule S = FStar.Seq\n\n#set-optio... |
[
{
"role": "user",
"content": "Complete this F* function with a correct proof.\n\nType: \n n: Prims.nat ->\n hs: MerkleTree.Spec.hashes{FStar.Seq.Base.length hs = 2 * n} ->\n nhs: MerkleTree.Spec.hashes{FStar.Seq.Base.length nhs = n}\n -> Prims.GTot Type0\nEffect: Prims.GTot\n\nContext:\nmodule Mer... |
[
{
"role": "user",
"content": "Complete this F* function with a correct proof.\n\nType: \n j: Prims.nat ->\n n: Prims.pos{j <= Prims.pow2 n} ->\n mt1: MerkleTree.Spec.merkle_tree n ->\n mt2: MerkleTree.Spec.merkle_tree n\n -> FStar.Pervasives.Lemma\n (requires FStar.Seq.Base.equal (FStar.Se... |
[
{
"role": "user",
"content": "Complete this F* function with a correct proof.\n\nType: \n st: Hacl.Spec.SHA2.Vec.state_spec a m ->\n j: Prims.nat{j < Hacl.Spec.SHA2.Vec.lanes a m} ->\n i: Prims.nat{i < 8 * Spec.Hash.Definitions.word_length a}\n -> FStar.Pervasives.Lemma\n (ensures\n (let l... |
[
{
"role": "user",
"content": "Complete this F* function with a correct proof.\n\nType: hs: MerkleTree.Spec.hashes{FStar.Seq.Base.length hs = 2 * n}\n -> Prims.GTot (nhs: MerkleTree.Spec.hashes{FStar.Seq.Base.length nhs = n})\nEffect: Prims.GTot\n\nContext:\nmodule MerkleTree.Spec\n\nopen FStar.Classical\no... |
[
{
"role": "user",
"content": "Complete this F* function with a correct proof.\n\nType: mt: MerkleTree.Spec.merkle_tree n -> Prims.GTot MerkleTree.Spec.padded_hash\nEffect: Prims.GTot\n\nContext:\nmodule MerkleTree.Spec\n\nopen FStar.Classical\nopen FStar.Mul\nopen FStar.Seq\n\nmodule S = FStar.Seq\n\n#set-o... |
[
{
"role": "user",
"content": "Complete this F* function with a correct proof.\n\nType: n: Prims.nat -> i: Prims.nat{i <= Prims.pow2 n} -> Type0\nEffect: Prims.Tot\n\nContext:\nmodule MerkleTree.Spec\n\nopen FStar.Classical\nopen FStar.Mul\nopen FStar.Seq\n\nmodule S = FStar.Seq\n\n#set-options \"--max_fuel ... |
[
{
"role": "user",
"content": "Complete this F* function with a correct proof.\n\nType: mt: MerkleTree.Spec.merkle_tree n -> MerkleTree.Spec.merkle_tree (n - 1)\nEffect: Prims.Tot\n\nContext:\nmodule MerkleTree.Spec\n\nopen FStar.Classical\nopen FStar.Mul\nopen FStar.Seq\n\nmodule S = FStar.Seq\n\n#set-optio... |
[
{
"role": "user",
"content": "Complete this F* function with a correct proof.\n\nType: hs: MerkleTree.Spec.hashes{FStar.Seq.Base.length hs = 2 * n} -> i: Prims.nat{i < n}\n -> FStar.Pervasives.Lemma\n (ensures\n (MerkleTree.Spec.hs_next_lv hs).[ i ] ==\n MerkleTree.Spec.padded_hash_fun f hs.[ ... |
[
{
"role": "user",
"content": "Complete this F* function with a correct proof.\n\nType: mt: MerkleTree.Spec.rpmt n i\n -> FStar.Pervasives.Lemma\n (ensures MerkleTree.Spec.pad_hashes mt <==> HPad? (MerkleTree.Spec.mt_get_root mt))\nEffect: FStar.Pervasives.Lemma\n\nContext:\nmodule MerkleTree.Spec\n\nope... |
[
{
"role": "user",
"content": "Complete this F* function with a correct proof.\n\nType: hs: MerkleTree.Spec.hashes{MerkleTree.Spec.raw_hashes hs}\n -> Prims.Tot (FStar.Seq.Base.seq MerkleTree.Spec.hash)\nEffect: Prims.Tot\n\nContext:\nmodule MerkleTree.Spec\n\nopen FStar.Classical\nopen FStar.Mul\nopen FSta... |
[
{
"role": "user",
"content": "Complete this F* function with a correct proof.\n\nType: n: Prims.pos -> mt: MerkleTree.Spec.merkle_tree n -> nmt: MerkleTree.Spec.merkle_tree (n - 1)\n -> FStar.Pervasives.Lemma (requires MerkleTree.Spec.mt_next_rel n mt nmt)\n (ensures FStar.Seq.Base.equal nmt (MerkleTr... |
[
{
"role": "user",
"content": "Complete this F* function with a correct proof.\n\nType: mt: MerkleTree.Spec.merkle_tree n\n -> FStar.Pervasives.Lemma\n (ensures\n FStar.Seq.Base.equal (MerkleTree.Spec.mt_next_lv (MerkleTree.Spec.mt_left mt))\n (MerkleTree.Spec.mt_left (MerkleTree.Spec.mt_next... |
[
{
"role": "user",
"content": "Complete this F* function with a correct proof.\n\nType: c0: Prims.int -> c1: Prims.int -> c2: Prims.int -> c3: Prims.int -> Prims.int\nEffect: Prims.Tot\n\nContext:\nmodule Vale.Curve25519.FastHybrid_helpers\n\nopen Vale.Def.Words_s\nopen Vale.Def.Types_s\nopen FStar.Mul\nopen... |
[
{
"role": "user",
"content": "Complete this F* function with a correct proof.\n\nType: hs: MerkleTree.Spec.hashes -> Prims.Tot Type0\nEffect: Prims.Tot\n\nContext:\nmodule MerkleTree.Spec\n\nopen FStar.Classical\nopen FStar.Mul\nopen FStar.Seq\n\nmodule S = FStar.Seq\n\n#set-options \"--max_fuel 0 --max_ifu... |
[
{
"role": "user",
"content": "Complete this F* function with a correct proof.\n\nType: hs: MerkleTree.Spec.hashes -> i: Prims.nat -> j: Prims.nat{i <= j && j <= FStar.Seq.Base.length hs}\n -> FStar.Pervasives.Lemma (requires MerkleTree.Spec.raw_hashes hs)\n (ensures MerkleTree.Spec.raw_hashes (FStar.S... |
[
{
"role": "user",
"content": "Complete this F* function with a correct proof.\n\nType: tm: FStar.Tactics.NamedView.term\n -> FStar.Tactics.Effect.Tac\n (FStar.Tactics.PatternMatching.matching_problem *\n FStar.Tactics.PatternMatching.abspat_continuation)\nEffect: FStar.Tactics.Effect.Tac\n\nContext... |
[
{
"role": "user",
"content": "Complete this F* function with a correct proof.\n\nType: p: MerkleTree.Spec.path n -> idx: Prims.nat{idx < Prims.pow2 n} -> h: MerkleTree.Spec.padded_hash\n -> Prims.GTot MerkleTree.Spec.padded_hash\nEffect: Prims.GTot\n\nContext:\nmodule MerkleTree.Spec\n\nopen FStar.Classica... |
[
{
"role": "user",
"content": "Complete this F* function with a correct proof.\n\nType: hs: MerkleTree.Spec.hashes -> i: Prims.nat{i < FStar.Seq.Base.length hs}\n -> FStar.Pervasives.Lemma (requires MerkleTree.Spec.raw_hashes hs)\n (ensures HRaw? hs.[ i ])\n (decreases i)\nEffect: FStar.Pervasives... |
[
{
"role": "user",
"content": "Complete this F* function with a correct proof.\n\nType: mt: MerkleTree.Spec.rpmt n i\n -> FStar.Pervasives.Lemma (ensures i > 0 <==> HRaw? (MerkleTree.Spec.mt_get_root mt))\nEffect: FStar.Pervasives.Lemma\n\nContext:\nmodule MerkleTree.Spec\n\nopen FStar.Classical\nopen FStar... |
[
{
"role": "user",
"content": "Complete this F* function with a correct proof.\n\nType: mt: MerkleTree.Spec.rpmt n i\n -> FStar.Pervasives.Lemma (ensures i = 0 <==> HPad? (MerkleTree.Spec.mt_get_root mt))\nEffect: FStar.Pervasives.Lemma\n\nContext:\nmodule MerkleTree.Spec\n\nopen FStar.Classical\nopen FStar... |
[
{
"role": "user",
"content": "Complete this F* function with a correct proof.\n\nType: mt: MerkleTree.Spec.rpmt n i -> FStar.Seq.Base.seq MerkleTree.Spec.hash\nEffect: Prims.Tot\n\nContext:\nmodule MerkleTree.Spec\n\nopen FStar.Classical\nopen FStar.Mul\nopen FStar.Seq\n\nmodule S = FStar.Seq\n\n#set-option... |
[
{
"role": "user",
"content": "Complete this F* function with a correct proof.\n\nType: \n j: Prims.nat ->\n n: Prims.pos{j <= 2 * n} ->\n hs1: MerkleTree.Spec.hashes{FStar.Seq.Base.length hs1 = 2 * n} ->\n hs2: MerkleTree.Spec.hashes{FStar.Seq.Base.length hs2 = 2 * n}\n -> FStar.Pervasives.Lemm... |
[
{
"role": "user",
"content": "Complete this F* function with a correct proof.\n\nType: mt: MerkleTree.Spec.merkle_tree n -> i: Prims.nat{i < Prims.pow2 n}\n -> Prims.GTot (MerkleTree.Spec.path n)\nEffect: Prims.GTot\n\nContext:\nmodule MerkleTree.Spec\n\nopen FStar.Classical\nopen FStar.Mul\nopen FStar.Seq... |
[
{
"role": "user",
"content": "Complete this F* function with a correct proof.\n\nType: hs: MerkleTree.Spec.hashes -> i: Prims.nat -> j: Prims.nat{i <= j && j <= FStar.Seq.Base.length hs}\n -> FStar.Pervasives.Lemma (requires MerkleTree.Spec.pad_hashes hs)\n (ensures MerkleTree.Spec.pad_hashes (FStar.S... |
[
{
"role": "user",
"content": "Complete this F* function with a correct proof.\n\nType: mt: MerkleTree.Spec.merkle_tree n\n -> FStar.Pervasives.Lemma\n (ensures\n MerkleTree.Spec.mt_get_root mt ==\n MerkleTree.Spec.padded_hash_fun f\n (MerkleTree.Spec.mt_get_root (MerkleTree.Spec.mt_left... |
[
{
"role": "user",
"content": "Complete this F* function with a correct proof.\n\nType: mt: MerkleTree.Spec.rpmt n i\n -> MerkleTree.Spec.rpmt (n - 1)\n (match i <= Prims.pow2 (n - 1) with\n | true -> i\n | _ -> Prims.pow2 (n - 1))\nEffect: Prims.Tot\n\nContext:\nmodule MerkleTree.Spec\n\... |
[
{
"role": "user",
"content": "Complete this F* function with a correct proof.\n\nType: mt: MerkleTree.Spec.merkle_tree n -> idx: Prims.nat{idx < Prims.pow2 n}\n -> FStar.Pervasives.Lemma\n (ensures\n (MerkleTree.Spec.mt_next_lv mt).[ idx / 2 ] ==\n (match idx % 2 = 0 with\n | true -> Me... |
[
{
"role": "user",
"content": "Complete this F* function with a correct proof.\n\nType: \n hs: MerkleTree.Spec.hashes{FStar.Seq.Base.length hs = 2 * n} ->\n i: Prims.nat ->\n j: Prims.nat{i <= j && j <= n}\n -> FStar.Pervasives.Lemma\n (ensures\n FStar.Seq.Base.equal (MerkleTree.Spec.hs... |
[
{
"role": "user",
"content": "Complete this F* function with a correct proof.\n\nType: t: MerkleTree.Spec.merkle_tree n -> i: Prims.nat{i < Prims.pow2 n}\n -> FStar.Pervasives.Lemma\n (ensures\n MerkleTree.Spec.mt_verify_ (MerkleTree.Spec.mt_get_path t i) i (MerkleTree.Spec.mt_get t i) ==\n Me... |
[
{
"role": "user",
"content": "Complete this F* function with a correct proof.\n\nType: \n n: Prims.nat ->\n hs: MerkleTree.Spec.hashes{FStar.Seq.Base.length hs = 2 * n} ->\n nhs: MerkleTree.Spec.hashes{FStar.Seq.Base.length nhs = n}\n -> FStar.Pervasives.Lemma (requires MerkleTree.Spec.hs_next_rel... |
[
{
"role": "user",
"content": "Complete this F* function with a correct proof.\n\nType: mt: MerkleTree.Spec.rpmt n i\n -> MerkleTree.Spec.rpmt (n - 1)\n (match i <= Prims.pow2 (n - 1) with\n | true -> 0\n | _ -> i - Prims.pow2 (n - 1))\nEffect: Prims.Tot\n\nContext:\nmodule MerkleTree.Spe... |
[
{
"role": "user",
"content": "Complete this F* function with a correct proof.\n\nType: mt: MerkleTree.Spec.merkle_tree n\n -> FStar.Pervasives.Lemma (ensures HPad? mt.[ 0 ] <==> HPad? (MerkleTree.Spec.mt_get_root mt))\nEffect: FStar.Pervasives.Lemma\n\nContext:\nmodule MerkleTree.Spec\n\nopen FStar.Classic... |
[
{
"role": "user",
"content": "Complete this F* function with a correct proof.\n\nType: r: Vale.X64.Machine_s.reg_64 -> FStar.Pervasives.Native.option (Vale.Interop.X64.reg_nat 3)\nEffect: Prims.Tot\n\nContext:\nmodule Vale.Inline.X64.Fswap_inline\n\nopen FStar.Mul\nopen FStar.HyperStack.ST\nmodule HS = FSta... |
[
{
"role": "user",
"content": "Complete this F* function with a correct proof.\n\nType: Vale.Interop.Base.td\nEffect: Prims.Tot\n\nContext:\nmodule Vale.Inline.X64.Fswap_inline\n\nopen FStar.Mul\nopen FStar.HyperStack.ST\nmodule HS = FStar.HyperStack\nmodule B = LowStar.Buffer\nmodule DV = LowStar.BufferView... |
[
{
"role": "user",
"content": "Complete this F* function with a correct proof.\n\nType: hs: MerkleTree.Spec.hashes{FStar.Seq.Base.length hs = 2 * n} -> idx: Prims.nat{idx < 2 * n}\n -> FStar.Pervasives.Lemma\n (ensures\n (MerkleTree.Spec.hs_next_lv hs).[ idx / 2 ] ==\n (match idx % 2 = 0 with\n... |
[
{
"role": "user",
"content": "Complete this F* function with a correct proof.\n\nType: Vale.Interop.Base.td\nEffect: Prims.Tot\n\nContext:\nmodule Vale.Inline.X64.Fswap_inline\n\nopen FStar.Mul\nopen FStar.HyperStack.ST\nmodule HS = FStar.HyperStack\nmodule B = LowStar.Buffer\nmodule DV = LowStar.BufferView... |
[
{
"role": "user",
"content": "Complete this F* function with a correct proof.\n\nType: Prims.eqtype\nEffect: Prims.Tot\n\nContext:\nmodule Vale.Inline.X64.Fswap_inline\n\nopen FStar.Mul\nopen FStar.HyperStack.ST\nmodule HS = FStar.HyperStack\nmodule B = LowStar.Buffer\nmodule DV = LowStar.BufferView.Down\no... |
[
{
"role": "user",
"content": "Complete this F* function with a correct proof.\n\nType: Vale.Interop.Base.td\nEffect: Prims.Tot\n\nContext:\nmodule Vale.Inline.X64.Fswap_inline\n\nopen FStar.Mul\nopen FStar.HyperStack.ST\nmodule HS = FStar.HyperStack\nmodule B = LowStar.Buffer\nmodule DV = LowStar.BufferView... |
[
{
"role": "user",
"content": "Complete this F* function with a correct proof.\n\nType: _: _ -> Prims.bool\nEffect: Prims.Tot\n\nContext:\nmodule Vale.Inline.X64.Fswap_inline\n\nopen FStar.Mul\nopen FStar.HyperStack.ST\nmodule HS = FStar.HyperStack\nmodule B = LowStar.Buffer\nmodule DV = LowStar.BufferView.D... |
[
{
"role": "user",
"content": "Complete this F* function with a correct proof.\n\nType: Type0\nEffect: Prims.Tot\n\nContext:\nmodule Vale.Inline.X64.Fswap_inline\n\nopen FStar.Mul\nopen FStar.HyperStack.ST\nmodule HS = FStar.HyperStack\nmodule B = LowStar.Buffer\nmodule DV = LowStar.BufferView.Down\nopen Val... |
[
{
"role": "user",
"content": "Complete this F* function with a correct proof.\n\nType: Vale.X64.Decls.va_code\nEffect: Prims.Tot\n\nContext:\nmodule Vale.Inline.X64.Fswap_inline\n\nopen FStar.Mul\nopen FStar.HyperStack.ST\nmodule HS = FStar.HyperStack\nmodule B = LowStar.Buffer\nmodule DV = LowStar.BufferVi... |
[
{
"role": "user",
"content": "Complete this F* function with a correct proof.\n\nType: Prims.list Prims.string\nEffect: Prims.Tot\n\nContext:\nmodule Vale.Inline.X64.Fswap_inline\n\nopen FStar.Mul\nopen FStar.HyperStack.ST\nmodule HS = FStar.HyperStack\nmodule B = LowStar.Buffer\nmodule DV = LowStar.BufferV... |
[
{
"role": "user",
"content": "Complete this F* function with a correct proof.\n\nType: n: Prims.nat -> Prims.string\nEffect: Prims.Tot\n\nContext:\nmodule Vale.Inline.X64.Fswap_inline\n\nopen FStar.Mul\nopen FStar.HyperStack.ST\nmodule HS = FStar.HyperStack\nmodule B = LowStar.Buffer\nmodule DV = LowStar.Bu... |
[
{
"role": "user",
"content": "Complete this F* function with a correct proof.\n\nType: x: Prims.nat -> y: Prims.nat\n -> FStar.Pervasives.Lemma\n (ensures\n (x - y * Vale.Curve25519.Fast_defs.pow2_256) % Vale.Curve25519.Fast_defs.prime ==\n (x - y * 38) % Vale.Curve25519.Fast_defs.prime)\nEffe... |
[
{
"role": "user",
"content": "Complete this F* function with a correct proof.\n\nType: FStar.Pervasives.norm [\n FStar.Pervasives.iota;\n FStar.Pervasives.zeta;\n FStar.Pervasives.delta_attr [\"Vale.Arch.HeapTypes_s.__reduce__\"; \"FStar.BigOps.__reduce__\"];\n FStar.Pervasives.delta_only [\n ... |
[
{
"role": "user",
"content": "Complete this F* function with a correct proof.\n\nType: r: Steel.GhostPCMReference.ref a pcm -> v: a -> Steel.Effect.Common.vprop\nEffect: Prims.Tot\n\nContext:\n(*\n Copyright 2020 Microsoft Research\n\n Licensed under the Apache License, Version 2.0 (the \"License\");\n ... |
[
{
"role": "user",
"content": "Complete this F* function with a correct proof.\n\nType: \n a0: Vale.Def.Types_s.nat64 ->\n a1: Vale.Def.Types_s.nat64 ->\n a2: Vale.Def.Types_s.nat64 ->\n a3: Vale.Def.Types_s.nat64 ->\n b: Vale.Def.Types_s.nat64 ->\n d0: Vale.Def.Types_s.nat64 ->\n d1: Va... |
[
{
"role": "user",
"content": "Complete this F* function with a correct proof.\n\nType: a: Type -> p: FStar.PCM.pcm a -> Type0\nEffect: Prims.Tot\n\nContext:\n(*\n Copyright 2020 Microsoft Research\n\n Licensed under the Apache License, Version 2.0 (the \"License\");\n you may not use this file except ... |
[
{
"role": "user",
"content": "Complete this F* function with a correct proof.\n\nType: r: Steel.GhostPCMReference.ref a p -> fact: Steel.Memory.property a -> Type0\nEffect: Prims.Tot\n\nContext:\n(*\n Copyright 2020 Microsoft Research\n\n Licensed under the Apache License, Version 2.0 (the \"License\");... |
[
{
"role": "user",
"content": "Complete this F* function with a correct proof.\n\nType: \n a0: Vale.Def.Types_s.nat64 ->\n a1: Vale.Def.Types_s.nat64 ->\n a2: Vale.Def.Types_s.nat64 ->\n a3: Vale.Def.Types_s.nat64 ->\n a0': Vale.Def.Types_s.nat64 ->\n a1': Vale.Def.Types_s.nat64 ->\n a2'... |
[
{
"role": "user",
"content": "Complete this F* function with a correct proof.\n\nType: Prims.int\nEffect: Prims.Tot\n\nContext:\nmodule Vale.SHA.PPC64LE.SHA_helpers\n\nopen FStar.Mul\nopen Vale.Def.Prop_s\nopen Vale.Def.Opaque_s\nopen Vale.Def.Types_s\nopen Vale.Def.Words_s\nopen Vale.Def.Words.Seq_s\nopen ... |
[
{
"role": "user",
"content": "Complete this F* function with a correct proof.\n\nType: Prims.int\nEffect: Prims.Tot\n\nContext:\nmodule Vale.SHA.PPC64LE.SHA_helpers\n\nopen FStar.Mul\nopen Vale.Def.Prop_s\nopen Vale.Def.Opaque_s\nopen Vale.Def.Types_s\nopen Vale.Def.Words_s\nopen Vale.Def.Words.Seq_s\nopen ... |
[
{
"role": "user",
"content": "Complete this F* function with a correct proof.\n\nType: Prims.int\nEffect: Prims.Tot\n\nContext:\nmodule Vale.SHA.PPC64LE.SHA_helpers\n\nopen FStar.Mul\nopen Vale.Def.Prop_s\nopen Vale.Def.Opaque_s\nopen Vale.Def.Types_s\nopen Vale.Def.Words_s\nopen Vale.Def.Words.Seq_s\nopen ... |
[
{
"role": "user",
"content": "Complete this F* function with a correct proof.\n\nType: Type0\nEffect: Prims.Tot\n\nContext:\nmodule Vale.SHA.PPC64LE.SHA_helpers\n\nopen FStar.Mul\nopen Vale.Def.Prop_s\nopen Vale.Def.Opaque_s\nopen Vale.Def.Types_s\nopen Vale.Def.Words_s\nopen Vale.Def.Words.Seq_s\nopen FSta... |
[
{
"role": "user",
"content": "Complete this F* function with a correct proof.\n\nType: \n a0: Vale.Def.Types_s.nat64 ->\n a1: Vale.Def.Types_s.nat64 ->\n a2: Vale.Def.Types_s.nat64 ->\n a3: Vale.Def.Types_s.nat64 ->\n a4: Vale.Def.Types_s.nat64 ->\n a5: Vale.Def.Types_s.nat64 ->\n a6: V... |
[
{
"role": "user",
"content": "Complete this F* function with a correct proof.\n\nType: Type0\nEffect: Prims.Tot\n\nContext:\nmodule Vale.SHA.PPC64LE.SHA_helpers\n\nopen FStar.Mul\nopen Vale.Def.Prop_s\nopen Vale.Def.Opaque_s\nopen Vale.Def.Types_s\nopen Vale.Def.Words_s\nopen Vale.Def.Words.Seq_s\nopen FSta... |
[
{
"role": "user",
"content": "Complete this F* function with a correct proof.\n\nType: Type0\nEffect: Prims.Tot\n\nContext:\nmodule Vale.SHA.PPC64LE.SHA_helpers\n\nopen FStar.Mul\nopen Vale.Def.Prop_s\nopen Vale.Def.Opaque_s\nopen Vale.Def.Types_s\nopen Vale.Def.Words_s\nopen Vale.Def.Words.Seq_s\nopen FSta... |
[
{
"role": "user",
"content": "Complete this F* function with a correct proof.\n\nType: _: Vale.SHA.PPC64LE.SHA_helpers.counter -> _: Vale.SHA.PPC64LE.SHA_helpers.block_w\n -> Vale.Def.Words_s.nat32\nEffect: Prims.Tot\n\nContext:\nmodule Vale.SHA.PPC64LE.SHA_helpers\n\nopen FStar.Mul\nopen Vale.Def.Prop_s\n... |
[
{
"role": "user",
"content": "Complete this F* function with a correct proof.\n\nType: \n a0: Vale.Def.Types_s.nat64 ->\n a1: Vale.Def.Types_s.nat64 ->\n a2: Vale.Def.Types_s.nat64 ->\n a3: Vale.Def.Types_s.nat64 ->\n a0': Vale.Def.Types_s.nat64 ->\n a1': Vale.Def.Types_s.nat64 ->\n a2'... |
[
{
"role": "user",
"content": "Complete this F* function with a correct proof.\n\nType: _: Prims.unit\n -> FStar.Pervasives.Lemma\n (ensures\n Vale.SHA.PPC64LE.SHA_helpers.sigma_1_0_partial ==\n Vale.SHA.PPC64LE.SHA_helpers.sigma_1_0_partial_def)\nEffect: FStar.Pervasives.Lemma\n\nContext:\nmod... |
[
{
"role": "user",
"content": "Complete this F* function with a correct proof.\n\nType: _: Prims.unit\n -> FStar.Pervasives.Lemma\n (ensures\n Vale.SHA.PPC64LE.SHA_helpers.sigma_0_1_partial ==\n Vale.SHA.PPC64LE.SHA_helpers.sigma_0_1_partial_def)\nEffect: FStar.Pervasives.Lemma\n\nContext:\nmod... |
[
{
"role": "user",
"content": "Complete this F* function with a correct proof.\n\nType: _: Prims.unit\n -> FStar.Pervasives.Lemma\n (ensures\n Vale.SHA.PPC64LE.SHA_helpers.sigma_0_0_partial ==\n Vale.SHA.PPC64LE.SHA_helpers.sigma_0_0_partial_def)\nEffect: FStar.Pervasives.Lemma\n\nContext:\nmod... |
[
{
"role": "user",
"content": "Complete this F* function with a correct proof.\n\nType: x: a -> Vale.Interop.Base.normal a\nEffect: Prims.Tot\n\nContext:\nmodule Vale.Inline.X64.Fswap_inline\n\nopen FStar.Mul\nopen FStar.HyperStack.ST\nmodule HS = FStar.HyperStack\nmodule B = LowStar.Buffer\nmodule DV = LowS... |
[
{
"role": "user",
"content": "Complete this F* function with a correct proof.\n\nType: \n _: Vale.SHA.PPC64LE.SHA_helpers.counter ->\n _: Vale.SHA.PPC64LE.SHA_helpers.block_w ->\n _: Vale.SHA.PPC64LE.SHA_helpers.hash256\n -> Vale.Def.Words_s.nat32\nEffect: Prims.Tot\n\nContext:\nmodule Vale.SHA.PP... |
[
{
"role": "user",
"content": "Complete this F* function with a correct proof.\n\nType: \n _: Vale.SHA.PPC64LE.SHA_helpers.counter ->\n _: Vale.SHA.PPC64LE.SHA_helpers.block_w ->\n _: Vale.SHA.PPC64LE.SHA_helpers.hash256\n -> Vale.Def.Words_s.nat32\nEffect: Prims.Tot\n\nContext:\nmodule Vale.SHA.PP... |
[
{
"role": "user",
"content": "Complete this F* function with a correct proof.\n\nType: _: Vale.SHA.PPC64LE.SHA_helpers.counter -> _: Vale.SHA.PPC64LE.SHA_helpers.block_w\n -> Vale.Def.Words_s.nat32\nEffect: Prims.Tot\n\nContext:\nmodule Vale.SHA.PPC64LE.SHA_helpers\n\nopen FStar.Mul\nopen Vale.Def.Prop_s\n... |
[
{
"role": "user",
"content": "Complete this F* function with a correct proof.\n\nType: _: Prims.unit\n -> FStar.Pervasives.Lemma\n (ensures\n Vale.SHA.PPC64LE.SHA_helpers.sigma_1_1_partial ==\n Vale.SHA.PPC64LE.SHA_helpers.sigma_1_1_partial_def)\nEffect: FStar.Pervasives.Lemma\n\nContext:\nmod... |
[
{
"role": "user",
"content": "Complete this F* function with a correct proof.\n\nType: block: Vale.SHA.PPC64LE.SHA_helpers.block_w -> hash: Vale.SHA.PPC64LE.SHA_helpers.hash256\n -> Vale.SHA.PPC64LE.SHA_helpers.hash256\nEffect: Prims.Tot\n\nContext:\nmodule Vale.SHA.PPC64LE.SHA_helpers\n\nopen FStar.Mul\no... |
[
{
"role": "user",
"content": "Complete this F* function with a correct proof.\n\nType: _: MerkleTree.Spec.mt_collide n i -> Prims.GTot MerkleTree.Spec.hash2_raw_collide\nEffect: Prims.GTot\n\nContext:\nmodule MerkleTree.Spec\n\nopen FStar.Classical\nopen FStar.Mul\nopen FStar.Seq\n\nmodule S = FStar.Seq\n\n... |
[
{
"role": "user",
"content": "Complete this F* function with a correct proof.\n\nType: \n a: Prims.nat ->\n b: Vale.Def.Types_s.nat64 ->\n a0: Vale.Def.Types_s.nat64 ->\n a1: Vale.Def.Types_s.nat64 ->\n a2: Vale.Def.Types_s.nat64 ->\n a3: Vale.Def.Types_s.nat64 ->\n ba0_hi: Vale.Def.Typ... |
[
{
"role": "user",
"content": "Complete this F* function with a correct proof.\n\nType: \n max: Prims.nat{max < Vale.SHA.PPC64LE.SHA_helpers.size_k_w_256} ->\n block: Vale.SHA.PPC64LE.SHA_helpers.block_w ->\n hash: Vale.SHA.PPC64LE.SHA_helpers.hash256\n -> Vale.SHA.PPC64LE.SHA_helpers.hash256\nEffe... |
[
{
"role": "user",
"content": "Complete this F* function with a correct proof.\n\nType: Type0\nEffect: Prims.Tot\n\nContext:\nmodule Vale.SHA.PPC64LE.SHA_helpers\n\nopen FStar.Mul\nopen Vale.Def.Prop_s\nopen Vale.Def.Opaque_s\nopen Vale.Def.Types_s\nopen Vale.Def.Words_s\nopen Vale.Def.Words.Seq_s\nopen FSta... |
[
{
"role": "user",
"content": "Complete this F* function with a correct proof.\n\nType: x: Vale.Interop.Base.normal a -> a\nEffect: Prims.Tot\n\nContext:\nmodule Vale.Inline.X64.Fswap_inline\n\nopen FStar.Mul\nopen FStar.HyperStack.ST\nmodule HS = FStar.HyperStack\nmodule B = LowStar.Buffer\nmodule DV = LowS... |
[
{
"role": "user",
"content": "Complete this F* function with a correct proof.\n\nType: \n u10: FStar.Stubs.Reflection.Types.universe ->\n a: FStar.Stubs.Reflection.Types.term ->\n e: FStar.Stubs.Reflection.Types.term ->\n p: FStar.Stubs.Reflection.Types.term ->\n x: FStar.Stubs.Reflection.V2.... |
[
{
"role": "user",
"content": "Complete this F* function with a correct proof.\n\nType: \n u20: FStar.Stubs.Reflection.Types.universe ->\n a: FStar.Stubs.Reflection.Types.term ->\n e: FStar.Stubs.Reflection.Types.term ->\n p: FStar.Stubs.Reflection.Types.term ->\n x: FStar.Stubs.Reflection.V2.... |
[
{
"role": "user",
"content": "Complete this F* function with a correct proof.\n\nType: FStar.Stubs.Reflection.Types.term\nEffect: Prims.Tot\n\nContext:\n(*\n Copyright 2023 Microsoft Research\n\n Licensed under the Apache License, Version 2.0 (the \"License\");\n you may not use this file except in co... |
[
{
"role": "user",
"content": "Complete this F* function with a correct proof.\n\nType: hash: Vale.SHA.PPC64LE.SHA_helpers.hash256 -> blocks: Vale.SHA.PPC64LE.SHA_helpers.bytes\n -> Vale.SHA.PPC64LE.SHA_helpers.hash256\nEffect: Prims.Tot\n\nContext:\nmodule Vale.SHA.PPC64LE.SHA_helpers\n\nopen FStar.Mul\nop... |
[
{
"role": "user",
"content": "Complete this F* function with a correct proof.\n\nType: \n u37: FStar.Stubs.Reflection.Types.universe ->\n a: FStar.Stubs.Reflection.Types.term ->\n x: FStar.Stubs.Reflection.Types.term ->\n p: FStar.Stubs.Reflection.Types.term\n -> FStar.Stubs.Reflection.Types.te... |
[
{
"role": "user",
"content": "Complete this F* function with a correct proof.\n\nType: ks: FStar.Seq.Base.seq Vale.Def.Types_s.quad32 -> i: Prims.nat -> Vale.Def.Words_s.nat32\nEffect: Prims.Tot\n\nContext:\nmodule Vale.SHA.PPC64LE.SHA_helpers\n\nopen FStar.Mul\nopen Vale.Def.Prop_s\nopen Vale.Def.Opaque_s\... |
[
{
"role": "user",
"content": "Complete this F* function with a correct proof.\n\nType: \n u55: FStar.Stubs.Reflection.Types.universe ->\n a: FStar.Stubs.Reflection.Types.term ->\n e: FStar.Stubs.Reflection.Types.term ->\n p: FStar.Stubs.Reflection.Types.term ->\n x: FStar.Stubs.Reflection.V2.... |
[
{
"role": "user",
"content": "Complete this F* function with a correct proof.\n\nType: i: Vale.Interop.X64.reg_nat 3 -> Vale.X64.Machine_s.reg_64\nEffect: Prims.Tot\n\nContext:\nmodule Vale.Inline.X64.Fswap_inline\n\nopen FStar.Mul\nopen FStar.HyperStack.ST\nmodule HS = FStar.HyperStack\nmodule B = LowStar.... |
[
{
"role": "user",
"content": "Complete this F* function with a correct proof.\n\nType: \n post: FStar.Stubs.Reflection.Types.term ->\n a: FStar.Stubs.Reflection.Types.term ->\n ret_t: FStar.Stubs.Reflection.Types.term ->\n x: FStar.Stubs.Reflection.Types.term\n -> FStar.Stubs.Reflection.Types.t... |
[
{
"role": "user",
"content": "Complete this F* function with a correct proof.\n\nType: \n u134: FStar.Stubs.Reflection.Types.universe ->\n aL: FStar.Stubs.Reflection.Types.term ->\n aR: FStar.Stubs.Reflection.Types.term ->\n postL: FStar.Stubs.Reflection.Types.term ->\n postR: FStar.Stubs.Ref... |
[
{
"role": "user",
"content": "Complete this F* function with a correct proof.\n\nType: \n u72: FStar.Stubs.Reflection.Types.universe ->\n a: FStar.Stubs.Reflection.Types.term ->\n x: FStar.Stubs.Reflection.Types.term ->\n p: FStar.Stubs.Reflection.Types.term\n -> FStar.Stubs.Reflection.Types.te... |
[
{
"role": "user",
"content": "Complete this F* function with a correct proof.\n\nType: \n u107: FStar.Stubs.Reflection.Types.universe ->\n a: FStar.Stubs.Reflection.Types.term ->\n x: FStar.Stubs.Reflection.Types.term ->\n p: FStar.Stubs.Reflection.Types.term\n -> FStar.Stubs.Reflection.Types.t... |
[
{
"role": "user",
"content": "Complete this F* function with a correct proof.\n\nType: \n u174: FStar.Stubs.Reflection.Types.universe ->\n a: FStar.Stubs.Reflection.Types.term ->\n p: FStar.Stubs.Reflection.Types.term ->\n x: FStar.Stubs.Reflection.V2.Data.var\n -> FStar.Stubs.Reflection.Types.... |
[
{
"role": "user",
"content": "Complete this F* function with a correct proof.\n\nType: Type0\nEffect: Prims.Tot\n\nContext:\nmodule Vale.Inline.X64.Fswap_inline\n\nopen FStar.Mul\nopen FStar.HyperStack.ST\nmodule HS = FStar.HyperStack\nmodule B = LowStar.Buffer\nmodule DV = LowStar.BufferView.Down\nopen Val... |
[
{
"role": "user",
"content": "Complete this F* function with a correct proof.\n\nType: s: FStar.Seq.Base.seq Vale.Def.Types_s.quad32 -> hash_orig: Vale.SHA.PPC64LE.SHA_helpers.hash256\n -> Prims.Tot Vale.SHA.PPC64LE.SHA_helpers.hash256\nEffect: Prims.Tot\n\nContext:\nmodule Vale.SHA.PPC64LE.SHA_helpers\n\n... |
Subsets and Splits
No community queries yet
The top public SQL queries from the community will appear here once available.