Skip to content

Commit

Permalink
Merge pull request #71 from dnat112/master
Browse files Browse the repository at this point in the history
Minor changes to comments
  • Loading branch information
kimlaine authored Nov 22, 2019
2 parents c9a5481 + 059764b commit b221f41
Show file tree
Hide file tree
Showing 2 changed files with 3 additions and 3 deletions.
2 changes: 1 addition & 1 deletion native/examples/2_encoders.cpp
Original file line number Diff line number Diff line change
Expand Up @@ -411,7 +411,7 @@ void example_ckks_encoder()
In CKKS the message is stored modulo coeff_modulus (in BFV it is stored modulo
plain_modulus), so the scaled message must not get too close to the total size
of coeff_modulus. In this case our coeff_modulus is quite large (218 bits) so
of coeff_modulus. In this case our coeff_modulus is quite large (210 bits) so
we have little to worry about in this regard. For this simple example a 30-bit
scale is more than enough.
*/
Expand Down
4 changes: 2 additions & 2 deletions native/examples/3_levels.cpp
Original file line number Diff line number Diff line change
Expand Up @@ -54,14 +54,14 @@ void example_levels()
CoeffModulus::MaxBitCount(poly_modulus_degree)
returns 218 (less than 50+30+30+50+50=210).
returns 218 (greater than 50+30+30+50+50=210).
Due to the modulus switching chain, the order of the 5 primes is significant.
The last prime has a special meaning and we call it the `special prime'. Thus,
the first parameter set in the modulus switching chain is the only one that
involves the special prime. All key objects, such as SecretKey, are created
at this highest level. All data objects, such as Ciphertext, can be only at
lower levels. The special modulus should be as large as the largest of the
lower levels. The special prime should be as large as the largest of the
other primes in the coeff_modulus, although this is not a strict requirement.
special prime +---------+
Expand Down

0 comments on commit b221f41

Please sign in to comment.