Skip to content
New issue

Have a question about this project? Sign up for a free GitHub account to open an issue and contact its maintainers and the community.

Sign up for GitHub

By clicking “Sign up for GitHub”, you agree to our terms of service and privacy statement. We’ll occasionally send you account related emails.

Already on GitHub? Sign in to your account

Jump to bottom

Minor changes to comments #71

Merged
merged 3 commits into from
Nov 22, 2019
Merged

Minor changes to comments #71

Show file tree
Hide file tree
Changes from all commits
Commits
Show all changes
3 commits
Select commit Hold shift + click to select a range
e5245c3
Update 2_encoders.cpp
dnat112 Nov 7, 2019
77735f1
Update 3_levels.cpp
dnat112 Nov 7, 2019
059764b
Update 3_levels.cpp
dnat112 Nov 7, 2019
File filter

Filter by extension

Filter by extension
Conversations
Failed to load comments.
Loading
Jump to
Jump to file
Failed to load files.
Loading
Diff view
Diff view
2 changes: 1 addition & 1 deletion native/examples/2_encoders.cpp
View file
Open in desktop
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
View file
Open in desktop
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