1 2 3 4 5 6 7 8 9 10 11 12 13 14 15 16 17 18 19 20 21 22 23 24 25 26 27 28 29 30 31 32 33 34 35 36 37 38 39 40 41 42 43 44 45 46 47 48 49 50 51 52 53 54 55 56 57 58 59 60 61
// Copyright (C) 2019-2022 Aleo Systems Inc.
// This file is part of the snarkVM library.
// The snarkVM library is free software: you can redistribute it and/or modify
// it under the terms of the GNU General Public License as published by
// the Free Software Foundation, either version 3 of the License, or
// (at your option) any later version.
// The snarkVM library is distributed in the hope that it will be useful,
// but WITHOUT ANY WARRANTY; without even the implied warranty of
// MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE. See the
// GNU General Public License for more details.
// You should have received a copy of the GNU General Public License
// along with the snarkVM library. If not, see <https://www.gnu.org/licenses/>.
use super::*;
impl<N: Network> TryFrom<Vec<Field<N>>> for Plaintext<N> {
type Error = Error;
/// Initializes a plaintext from a list of base field elements.
fn try_from(fields: Vec<Field<N>>) -> Result<Self, Self::Error> {
Self::from_fields(&fields)
}
}
impl<N: Network> TryFrom<&[Field<N>]> for Plaintext<N> {
type Error = Error;
/// Initializes a plaintext from a list of base field elements.
fn try_from(fields: &[Field<N>]) -> Result<Self, Self::Error> {
Self::from_fields(fields)
}
}
impl<N: Network> FromFields for Plaintext<N> {
type Field = Field<N>;
/// Initializes a plaintext from a list of base field elements.
fn from_fields(fields: &[Self::Field]) -> Result<Self> {
// Ensure the number of field elements does not exceed the maximum allowed size.
if fields.len() > N::MAX_DATA_SIZE_IN_FIELDS as usize {
bail!("Plaintext exceeds maximum allowed size")
}
// Unpack the field elements into little-endian bits, and reverse the list for popping the terminus bit off.
let mut bits_le =
fields.iter().flat_map(|field| field.to_bits_le()[..Field::<N>::size_in_data_bits()].to_vec()).rev();
// Remove the terminus bit that was added during encoding.
for boolean in bits_le.by_ref() {
// Drop all extraneous `0` bits, in addition to the final `1` bit.
if boolean {
// This case will always be reached, since the terminus bit is always `1`.
break;
}
}
// Reverse the bits back and recover the data from the bits.
Self::from_bits_le(&bits_le.rev().collect::<Vec<_>>())
}
}