In polynomial commitments, evaluation proofs are nothing but a reduction from average case correctness of the pcs to worst case correctness of the pcs, isn't it, inspired from LDCs and LTCs.
September 6, 2025 at 5:37 AM
In polynomial commitments, evaluation proofs are nothing but a reduction from average case correctness of the pcs to worst case correctness of the pcs, isn't it, inspired from LDCs and LTCs.
I think my fears about the PCPs have gone now, a noobish question, does a similar transform help one in converting any IPCP/IOP into a PCP??
Maybe this isn't even a valid question. Nevertheless I'm super happy 😊. Binge watched Tom Gur's lectures "Foundations and Frontiers of Probabilistic Proofs".
Maybe this isn't even a valid question. Nevertheless I'm super happy 😊. Binge watched Tom Gur's lectures "Foundations and Frontiers of Probabilistic Proofs".
December 29, 2024 at 11:18 AM
I think my fears about the PCPs have gone now, a noobish question, does a similar transform help one in converting any IPCP/IOP into a PCP??
Maybe this isn't even a valid question. Nevertheless I'm super happy 😊. Binge watched Tom Gur's lectures "Foundations and Frontiers of Probabilistic Proofs".
Maybe this isn't even a valid question. Nevertheless I'm super happy 😊. Binge watched Tom Gur's lectures "Foundations and Frontiers of Probabilistic Proofs".
I'm wondering what will be the implication of the following result in an efficient Verifier hash based snark proof system to boost its soundness.
December 19, 2024 at 9:36 AM
I'm wondering what will be the implication of the following result in an efficient Verifier hash based snark proof system to boost its soundness.
#Asiacrypt2024
It's been ages since I have used one.
It's been ages since I have used one.
December 15, 2024 at 4:30 AM
#Asiacrypt2024
It's been ages since I have used one.
It's been ages since I have used one.
