feat: Sync from aztec-packages

.aztec-sync-commit

@@ -1 +1 @@
-73d640a4a033f0c865d45da470ef40c1fb03a844
+7ff9b71d8d87fc93ae7dbd8ba63f5176b0cd17be

acvm-repo/acvm/src/compiler/optimizers/mod.rs

@@ -1,6 +1,6 @@
 use acir::circuit::{Circuit, Opcode};
 
-mod constant_backpropagation;
+// mod constant_backpropagation;
 mod general;
 mod redundant_range;
 mod unused_memory;
@@ -9,7 +9,7 @@ pub(crate) use general::GeneralOptimizer;
 pub(crate) use redundant_range::RangeOptimizer;
 use tracing::info;
 
-use self::constant_backpropagation::ConstantBackpropagationOptimizer;
+// use self::constant_backpropagation::ConstantBackpropagationOptimizer;
 use self::unused_memory::UnusedMemoryOptimizer;
 
 use super::{transform_assert_messages, AcirTransformationMap};
@@ -58,16 +58,16 @@ pub(super) fn optimize_internal(acir: Circuit) -> (Circuit, Vec<usize>) {
     let (acir, acir_opcode_positions) =
         memory_optimizer.remove_unused_memory_initializations(acir_opcode_positions);
 
-    let (acir, acir_opcode_positions) =
-        ConstantBackpropagationOptimizer::backpropagate_constants(acir, acir_opcode_positions);
+    // let (acir, acir_opcode_positions) =
+    // ConstantBackpropagationOptimizer::backpropagate_constants(acir, acir_opcode_positions);
 
     // Range optimization pass
     let range_optimizer = RangeOptimizer::new(acir);
     let (acir, acir_opcode_positions) =
         range_optimizer.replace_redundant_ranges(acir_opcode_positions);
 
-    let (acir, acir_opcode_positions) =
-        ConstantBackpropagationOptimizer::backpropagate_constants(acir, acir_opcode_positions);
+    // let (acir, acir_opcode_positions) =
+    // ConstantBackpropagationOptimizer::backpropagate_constants(acir, acir_opcode_positions);
 
     info!("Number of opcodes after: {}", acir.opcodes.len());
 

aztec_macros/src/lib.rs

@@ -445,13 +445,12 @@
             } else if is_custom_attribute(&secondary_attribute, "aztec(initializer)") {
                 is_initializer = true;
                 insert_init_check = false;
             } else if is_custom_attribute(&secondary_attribute, "aztec(noinitcheck)") {
                 insert_init_check = false;
             } else if is_custom_attribute(&secondary_attribute, "aztec(internal)") {
                 is_internal = true;
             } else if is_custom_attribute(&secondary_attribute, "aztec(public)") {
                 is_public = true;
-                insert_init_check = false;
             } else if is_custom_attribute(&secondary_attribute, "aztec(public-vm)") {
                 is_public_vm = true;
             }
@@ -673,15 +672,6 @@
 
     // Add initialization check
     if insert_init_check {
-        if ty == "Public" {
-            let error = AztecMacroError::UnsupportedAttributes {
-                span: func.def.name.span(),
-                secondary_message: Some(
-                    "public functions do not yet support initialization check".to_owned(),
-                ),
-            };
-            return Err(error);
-        }
         let init_check = create_init_check();
         func.def.body.0.insert(0, init_check);
     }
@@ -711,16 +701,7 @@
 
     // Before returning mark the contract as initialized
     if is_initializer {
-        if ty == "Public" {
-            let error = AztecMacroError::UnsupportedAttributes {
-                span: func.def.name.span(),
-                secondary_message: Some(
-                    "public functions cannot yet be used as initializers".to_owned(),
-                ),
-            };
-            return Err(error);
-        }
-        let mark_initialized = create_mark_as_initialized();
+        let mark_initialized = create_mark_as_initialized(ty);
         func.def.body.0.push(mark_initialized);
     }
 
@@ -1179,9 +1160,10 @@
 /// ```noir
 /// mark_as_initialized(&mut context);
 /// ```
-fn create_mark_as_initialized() -> Statement {
+fn create_mark_as_initialized(ty: &str) -> Statement {
+    let name = if ty == "Public" { "mark_as_initialized_public" } else { "mark_as_initialized" };
     make_statement(StatementKind::Expression(call(
-        variable_path(chained_dep!("aztec", "initializer", "mark_as_initialized")),
+        variable_path(chained_dep!("aztec", "initializer", name)),
         vec![mutable_reference("context")],
     )))
 }
@@ -1373,13 +1355,13 @@
 /// Any primitive type that can be cast will be casted to a field and pushed to the context.
 fn abstract_return_values(func: &NoirFunction) -> Option<Statement> {
     let current_return_type = func.return_type().typ;
-    let last_statement = func.def.body.0.last();
+    let last_statement = func.def.body.0.last()?;
 
     // TODO: (length, type) => We can limit the size of the array returned to be limited by kernel size
     // Doesn't need done until we have settled on a kernel size
     // TODO: support tuples here and in inputs -> convert into an issue
     // Check if the return type is an expression, if it is, we can handle it
-    match last_statement? {
+    match last_statement {
         Statement { kind: StatementKind::Expression(expression), .. } => {
             match current_return_type {
                 // Call serialize on structs, push the whole array, calling push_array
@@ -1772,8 +1754,8 @@
     // If compute_note_hash_and_nullifier is already defined by the user, we skip auto-generation in order to provide an
     // escape hatch for this mechanism.
     // TODO(#4647): improve this diagnosis and error messaging.
     if collected_functions.iter().any(|coll_funcs_data| {
         check_for_compute_note_hash_and_nullifier_definition(&coll_funcs_data.functions, module_id)
     }) {
         return Ok(());
     }
@@ -1827,7 +1809,7 @@
     unresolved_traits_impls: &[UnresolvedTraitImpl],
     trait_name: &str,
 ) -> Vec<String> {
     let mut struct_typenames: Vec<String> = Vec::new();
 
     // These structs can be declared in either external crates or the current one. External crates that contain
     // dependencies have already been processed and resolved, but are available here via the NodeInterner. Note that
@@ -1837,7 +1819,7 @@
 
         if trait_impl.borrow().ident.0.contents == *trait_name {
             if let Type::Struct(s, _) = &trait_impl.borrow().typ {
                 struct_typenames.push(s.borrow().name.0.contents.clone());
             } else {
                 panic!("Found impl for {} on non-Struct", trait_name);
             }
@@ -1845,7 +1827,7 @@
     }
 
     // This crate's traits and impls have not yet been resolved, so we look for impls in unresolved_trait_impls.
     struct_typenames.extend(
         unresolved_traits_impls
             .iter()
             .filter(|trait_impl| {
@@ -1866,7 +1848,7 @@
             }),
     );
 
     struct_typenames
 }
 
 fn generate_compute_note_hash_and_nullifier(note_types: &Vec<String>) -> NoirFunction {

noir_stdlib/src/sha512.nr

@@ -136,7 +136,7 @@ pub fn digest<N>(msg: [u8; N]) -> [u8; 64] {
             msg_block[i as Field] = 0;
             i += 1;
         } else if i < 128 {
-            let mut len = 8 * msg.len(); // u128 unsupported
+            let mut len = 8 * msg.len();
             for j in 0..16 {
                 msg_block[127 - j] = len as u8;
                 len >>= 8;