github/tfhe-rs
1
1
Fork 0
mirror of https://github.com/zama-ai/tfhe-rs.git synced 2026-01-08 22:28:01 -05:00
Code Issues Packages Projects Releases Wiki Activity

chore: fix typos

Browse Source
This commit is contained in:
Arthur Meyre
2023-10-05 10:57:42 +02:00
parent 52a7c52a49
commit 69536960c3
12 changed files with 25 additions and 25 deletions
Download Patch File Download Diff File Expand all files Collapse all files

2
apps/trivium/src/kreyvium/kreyvium_byte.rs
View File

@@ -31,7 +31,7 @@ impl KreyviumByteInput<FheUint8> for &FheUint8 {}
/// representation of bits (u8 or FheUint8). To be able to compute FHE operations, it also owns
/// an Option for a ServerKey.
/// Since the original Kreyvium registers' sizes are not a multiple of 8, these registers (which
/// store byte-like objects) have a size that is the eigth of the closest multiple of 8 above the
/// store byte-like objects) have a size that is the eighth of the closest multiple of 8 above the
/// originals' sizes.
pub struct KreyviumStreamByte<T> {
a_byte: StaticByteDeque<12, T>,

2
apps/trivium/src/trivium/trivium_byte.rs
View File

@@ -31,7 +31,7 @@ impl TriviumByteInput<FheUint8> for &FheUint8 {}
/// representation of bits (u8 or FheUint8). To be able to compute FHE operations, it also owns
/// an Option for a ServerKey.
/// Since the original Trivium registers' sizes are not a multiple of 8, these registers (which
/// store byte-like objects) have a size that is the eigth of the closest multiple of 8 above the
/// store byte-like objects) have a size that is the eighth of the closest multiple of 8 above the
/// originals' sizes.
pub struct TriviumStreamByte<T> {
a_byte: StaticByteDeque<12, T>,

2
tfhe/docs/fine_grained_api/quick_start.md
View File

@@ -141,7 +141,7 @@ use tfhe::integer::gen_keys_radix;
use tfhe::shortint::parameters::PARAM_MESSAGE_2_CARRY_2;
fn main() {
// We create keys for radix represention to create 16 bits integers
// We create keys for radix representation to create 16 bits integers
// using 8 blocks of 2 bits
let (cks, sks) = gen_keys_radix(PARAM_MESSAGE_2_CARRY_2, 8);

2
tfhe/src/high_level_api/integers/types/base.rs
View File

@@ -809,7 +809,7 @@ where
// Shifts and rotations are special cases where the right hand side
// is for now, required to be a unsigned integer type.
// And its contrains are a bit relaxed: rhs does not needs to have the same
// And its constraints are a bit relaxed: rhs does not needs to have the same
// amount a bits.
macro_rules! generic_integer_impl_shift_rotate (
($rust_trait_name:ident($rust_trait_method:ident) => $key_method:ident) => {

2
tfhe/src/high_level_api/keys/server.rs
View File

@@ -57,7 +57,7 @@ impl AsRef<crate::integer::ServerKey> for ServerKey {
// serde has a `rc` feature to allow deriving on Arc and Rc types
// but activating it in our lib would mean also activate it for all the dependency stack,
// so tfhe-rs users would have this feature enabled on our behalf and we don't want that
// so whe implement the serialization / deseriazation ourselves.
// so we implement the serialization / deseriazation ourselves.
//
// In the case of our ServerKey, this is fine, we expect programs to only
// serialize and deserialize the same server key only once.

2
tfhe/src/integer/ciphertext/mod.rs
View File

@@ -177,7 +177,7 @@ pub trait IntegerRadixCiphertext: IntegerCiphertext + Sync + Send + From<Vec<Cip
self.blocks().iter().all(|block| block.carry_is_empty())
}
/// Returns wether the ciphertext _seems_ like it holds/encrypts
/// Returns whether the ciphertext _seems_ like it holds/encrypts
/// a boolean (0 or 1) value.
///
/// Since it uses degree to do so, it will not

2
tfhe/src/integer/server_key/comparator.rs
View File

@@ -717,7 +717,7 @@ where {
// from the ciphertext that can represent the scalar value
//
// - The other part is to compare the ciphertext blocks not considered for the sign
// computation with zero, and create a signle sign block from that.
// computation with zero, and create a single sign block from that.
//
// The smaller the scalar value is comparaed to the ciphertext num bits encrypted,
// the more the comparisons with zeros we have to do,

4
tfhe/src/integer/server_key/radix/mod.rs
View File

@@ -434,8 +434,8 @@ where {
.key
.apply_lookup_table(last_block, &padding_block_creator_lut);
let new_lew = num_blocks + ct.blocks.len();
ct.blocks.resize(new_lew, padding_block);
let new_len = num_blocks + ct.blocks.len();
ct.blocks.resize(new_len, padding_block);
}
/// Extends the most significant blocks using the sign bit.

2
tfhe/src/integer/server_key/radix_parallel/scalar_div_mod.rs
View File

@@ -689,7 +689,7 @@ impl ServerKey {
T: SignedReciprocable,
<<T as SignedReciprocable>::Unsigned as Reciprocable>::DoublePrecision: Send,
{
assert_ne!(divisor, T::ZERO, "Cannot devide by zero");
assert_ne!(divisor, T::ZERO, "Cannot divide by zero");
let numerator_bits = self.key.message_modulus.0.ilog2() * numerator.blocks.len() as u32;

8
tfhe/src/integer/server_key/radix_parallel/scalar_shift.rs
View File

@@ -164,7 +164,7 @@ impl ServerKey {
// if there is only 1 bit in the msg part, it means shift_within block is 0
// thus only rotations is required.
// We still need to padd with the value of the sign bit.
// We still need to pad with the value of the sign bit.
// And here since a block only has 1 bit of message
// we can optimize things by not doing the pbs to extract this sign bit
let sign_bit = ct.blocks()[num_blocks - rotations - 1].clone();
@@ -176,7 +176,7 @@ impl ServerKey {
let message_modulus = self.key.message_modulus.0 as u64;
// In the artithemtic shift case we have to padd with the value of the sign bit.
// In the artithemtic shift case we have to pad with the value of the sign bit.
//
// This creates the need for a different shifting lut than in the logical shift case
// and also we need another PBS to create the padding block.
@@ -199,7 +199,7 @@ impl ServerKey {
});
let last_block = &ct.blocks()[num_blocks - rotations - 1];
let padd_block_creator_lut = self.key.generate_lookup_table(|x| {
let pad_block_creator_lut = self.key.generate_lookup_table(|x| {
let x = x % message_modulus;
let x_sign_bit = x >> (num_bits_in_block - 1) & 1;
// padding is a message full of 1 if sign bit is one
@@ -211,7 +211,7 @@ impl ServerKey {
|| self.key.apply_lookup_table(last_block, &last_block_lut),
|| {
self.key
.apply_lookup_table(last_block, &padd_block_creator_lut)
.apply_lookup_table(last_block, &pad_block_creator_lut)
},
)
};

14
tfhe/src/integer/server_key/radix_parallel/tests_signed.rs
View File

@@ -175,10 +175,10 @@ fn rotate_left_helper(value: i64, n: u32, actual_bit_size: u32) -> i64 {
// If the sign bit after rotation is one,
// then all bits above it needs to be one
let new_sign_bit = (tmp >> (actual_bit_size - 1)) & 1;
let mut padd = -new_sign_bit;
padd <<= actual_bit_size; // only bits above actual_bit_size should be set
let mut pad = -new_sign_bit;
pad <<= actual_bit_size; // only bits above actual_bit_size should be set
padd | tmp
pad | tmp
}
/// helper function to do a rotate right when the type used to store
@@ -213,10 +213,10 @@ fn rotate_right_helper(value: i64, n: u32, actual_bit_size: u32) -> i64 {
// If the sign bit after rotation is one,
// then all bits above it needs to be one
let new_sign_bit = (tmp >> (actual_bit_size - 1)) & 1;
let mut padd = -new_sign_bit;
padd <<= actual_bit_size; // only bits above actual_bit_size should be set
let mut pad = -new_sign_bit;
pad <<= actual_bit_size; // only bits above actual_bit_size should be set
padd | tmp
pad | tmp
}
/// Returns an array filled with random values such that:
@@ -1833,7 +1833,7 @@ fn integer_signed_unchecked_scalar_div_rem(param: impl Into<PBSParameters>) {
assert_eq!(r, signed_rem_under_modulus(clear_0, d, modulus));
}
// 3 / -3 taks the second branch in the if else if series
// 3 / -3 takes the second branch in the if else if series
for d in [3, -3] {
{
let neg_clear_0 = rng.gen_range(-modulus..=0);

8
tfhe/src/safe_deserialization.rs
View File

@@ -221,7 +221,7 @@ mod test_integer {
safe_serialize(&ct_list, &mut buffer, 1 << 40).unwrap();
for paremeter_set in [
for parameter_set in [
(
PARAM_MESSAGE_3_CARRY_3_KS_PBS.into(),
ListSizeConstraint::exact_size(3),
@@ -248,12 +248,12 @@ mod test_integer {
assert!(safe_deserialize_conformant::<CompactFheUint8List>(
buffer.as_slice(),
1 << 20,
paremeter_set,
parameter_set,
)
.is_err());
}
for paremeter_set in [
for parameter_set in [
(
PARAM_MESSAGE_2_CARRY_2_KS_PBS.into(),
ListSizeConstraint::exact_size(3),
@@ -273,7 +273,7 @@ mod test_integer {
]
.iter()
{
assert!(ct_list.is_conformant(paremeter_set));
assert!(ct_list.is_conformant(parameter_set));
}
let ct2 = safe_deserialize_conformant::<CompactFheUint8List>(