Score:1

Verifiable Delay Function: Trusted Setup

tv flag

Efficient Verifiable Delay Function paper suggested that there is two way to construct the group. One of them requires trusted setup in the sense whoever constructs the RSA unknown group order needs to destroy the factors otherwise fake proof can be constructed.

Another way is using a class group of imaginary quadratic fields. However, the paper didn't give an example of how it can be used. Is everything else except this step the same, or it requires different proof verification?

fgrieu avatar
ng flag
Problems with verifiable delay functions include 1) the intended delay can be shrunk by a sizable factor (like 10) using specialized fast hardware (it can't be parallelized, though). 2) energy cost is proportional to delay. For these reasons, they are never used in practice AFAIK [update: now I know better, see below].
meshcollider avatar
gb flag
@fgrieu they are used in Chia, for example ([link](https://docs.chia.net/docs/03consensus/vdfs/)).
Score:0
cn flag

The paper actually explains how to sample parameters for the class group setting on page 9. Everything else is oblivious of the particular choice of the hidden order group. The description given in the paper is not specific to RSA groups and can be instantiated identically in the class group setting.

mangohost

Post an answer

Most people don’t grasp that asking a lot of questions unlocks learning and improves interpersonal bonding. In Alison’s studies, for example, though people could accurately recall how many questions had been asked in their conversations, they didn’t intuit the link between questions and liking. Across four studies, in which participants were engaged in conversations themselves or read transcripts of others’ conversations, people tended not to realize that question asking would influence—or had influenced—the level of amity between the conversationalists.