… Rational Arguments, which beyond postulating a rational prover additionally assumes that
he is computationally bounded. We show how to realize rational arguments … of rational proofs …

… Our consistency test could then be viewed as an analogue of using “rational constraints”
and the FRI protocol to check the claimed evaluations of the polynomial committed in a Reed–…

… Rational Proofs and Arguments. One recent notion that opens the door for sublinear
verification is that of rational arguments [15]. This model follows the paradigm of rational proofs …

… , we study rational proofs in which the verifier is also rational, … delegation scheme with
sublinear verification for functions … We present a fully-rational argument for functions computable …

… against rational adversaries that are also computationally bounded. Rational arguments are
… very efficient protocols, and in particular sublinear verification (ie where the Verifier does not …

… We propose another IP argument with sublinear verifier, … to construct an IP argument protocol
with sublinear verifier. After … We can verify that this process is a reduction to a one 2n-th …

… We present new protocols for the verification of space bounded … For such computations
requiring sublinear space our … bounded (eg the rational argument model introduced in [15]) and …

… research on verification of outsourced computation. Researchers strive for verifying the result
… Unfortunately, PCPs and hence arguments are wildly impractical: traditional PCPs are too …

… arguments. Improvements in the efficiency of IOPs lead to improvements in the efficiency of
succinct arguments. … Therefore, as long as F/Fp has at least a distinct rational places, we can …

… sublinear. The technique makes use of probabilistically checkable proofs (PCPs), which are
proofs that can be verified … We use M to represent the logical memory of a RAM program and …