…AM arrays exist

* Several changes to UltraPlonk to make proofs more amenable to be verified by a smart contract.

Linearisation trick has been removed from base UltraPlonk. Adds unnecessary complexity
TurboPlonk fixed-base Pedersen gate has been removed from UltraPlonk. We only added it for backwards-compatibility with TurboPlonk in case we upgraded Aztec Connect to UP. Given that is redundant, the gate adds unnecessary complexity. Ideally we move forward by standardising on the (much simpler) UltraPlonk Pedersen hash
UltraPlonk uses plookup Pedersen by default, but remains backwards-compatible with TurboPlonk Pedersen hash by using StandardComposer's fallback methods for create_fixed_group_add_gate, create_fixed_group_add_gate_init, create_fixed_group_add_gate_final. These methods have been moved out of StandardComposer and into a stdlib::pedersen_gates class to prevent code duplication.
Copied @dbanks12 barretenberg CMake changes from PR [REPLACED] Move README.md into cpp and add a simple top-level one #56 (to more easily build key/proof generation scripts in aztec-verifier-contract-tests)
Added code to generate UltraPlonk verification keys

* bonk

* removed composer tests that use now-deleted fixed_group gates for standard composer

* fixed wasm build error

* fixed ultra recursive verifier to not use fixed base widget.

removed unused `generalized_permutation_verifier_settings`