Score:0

What is minimum size of polynomial modulus in Seal implementation of BFV?

es flag

Is there a way to get flexible parameters in Seal for batching? The issue is that for polynomial mod $n=4096$, the function I am computing has a multiplicative depth of $3~4$, to handle noise growth I am trying to set smaller plaintext modulus $t~10$ bits but I keep getting an error that there are not enough primes. It looks like setting $t$ to $17$ bits is a sort of minimum requirement for batching, because anything below that gives this error? is there any way to set smaller $t$?

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.