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.

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

chore: redo typo PR by stayweek #6080

Merged
merged 1 commit into from
Apr 30, 2024
Merged
Show file tree
Hide file tree
Changes from all commits
Commits
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 barretenberg/acir_tests/headless-test/src/index.ts
Original file line number Diff line number Diff line change
Expand Up @@ -51,7 +51,7 @@ const readWitnessFile = (path: string): Uint8Array => {
// Set up the command-line interface
const program = new Command();
program.option("-v, --verbose", "verbose logging");
program.option("-c, --crs-path <path>", "ignored (here for compatability)");
program.option("-c, --crs-path <path>", "ignored (here for compatibility)");

program
.command("prove_and_verify")
Expand Down
2 changes: 1 addition & 1 deletion barretenberg/acir_tests/sol-test/src/index.js
Original file line number Diff line number Diff line change
Expand Up @@ -137,7 +137,7 @@ const readPublicInputs = (proofAsFields) => {
* Get Anvil
*
* Creates an anvil instance on a random port, and returns the instance and the port
* If the port is alredy allocated, it will try again
* If the port is already allocated, it will try again
* @returns {[ChildProcess, Number]} [anvil, port]
*/
const getAnvil = async () => {
Expand Down
Original file line number Diff line number Diff line change
Expand Up @@ -15,13 +15,13 @@ template <class Flavor> size_t ProverInstance_<Flavor>::compute_dyadic_size(Circ
// minimum circuit size due to lookup argument
const size_t min_size_due_to_lookups = circuit.get_tables_size() + circuit.get_lookups_size();

// minumum size of execution trace due to everything else
// minimum size of execution trace due to everything else
size_t min_size_of_execution_trace = circuit.public_inputs.size() + circuit.num_gates;
if constexpr (IsGoblinFlavor<Flavor>) {
min_size_of_execution_trace += circuit.blocks.ecc_op.size();
}

// The number of gates is the maxmimum required by the lookup argument or everything else, plus an optional zero row
// The number of gates is the maximum required by the lookup argument or everything else, plus an optional zero row
// to allow for shifts.
size_t num_zero_rows = Flavor::has_zero_row ? 1 : 0;
size_t total_num_gates = num_zero_rows + std::max(min_size_due_to_lookups, min_size_of_execution_trace);
Expand Down
2 changes: 1 addition & 1 deletion l1-contracts/scripts/ci_deploy_contracts.sh
Original file line number Diff line number Diff line change
Expand Up @@ -10,7 +10,7 @@ CONTENT_HASH=$(calculate_content_hash $REPOSITORY)

echo "Last successfully published commit: $CONTENT_HASH"

# Check if image hash has alredy been deployed.
# Check if image hash has already been deployed.
if check_rebuild "cache-$CONTENT_HASH-$DEPLOY_TAG-deployed" $REPOSITORY; then
echo "No changes detected, no contract deploy necessary."
# Set global variable for redeployment of contracts
Expand Down
2 changes: 1 addition & 1 deletion scripts/git-subrepo/note/Dags
Original file line number Diff line number Diff line change
@@ -1,4 +1,4 @@
== ASCII commmit DAG diagrams
== ASCII commit DAG diagrams

D--E--F--G--H
/ /
Expand Down
Loading