docs: type fix lib/

Author: boray

src/lib/mina/v1/account-update.ts

@@ -1129,7 +1129,7 @@ class AccountUpdate implements Types.AccountUpdate {
    * This function acts as the `check()` method on an `AccountUpdate` that is sent to the Mina node as part of a transaction.
    *
    * Background: the Mina node performs most necessary validity checks on account updates, both in- and outside of circuits.
-   * To save constraints, we don't repeat these checks in zkApps in places where we can be sure the checked account udpates
+   * To save constraints, we don't repeat these checks in zkApps in places where we can be sure the checked account updates
    * will be part of a transaction.
    *
    * However, there are a few checks skipped by the Mina node, that could cause vulnerabilities in zkApps if

src/lib/mina/v1/mina.ts

@@ -331,7 +331,7 @@ function Network(
     },
     transaction(sender: FeePayerSpec, f: () => Promise<void>) {
       return toTransactionPromise(async () => {
-        // TODO we run the transcation twice to be able to fetch data in between
+        // TODO we run the transaction twice to be able to fetch data in between
         let tx = await createTransaction(sender, f, 0, {
           fetchMode: 'test',
           isFinalRunOutsideCircuit: false,

src/lib/mina/v1/state.ts

@@ -269,7 +269,7 @@ function createState<T>(defaultValue?: T): InternalStateType<T> {
       if (this._contract === undefined)
         throw Error('get can only be called when the State is assigned to a SmartContract @state.');
       // inside the circuit, we have to cache variables, so there's only one unique variable per on-chain state.
-      // if we'd return a fresh variable everytime, developers could easily end up linking just *one* of them to the precondition,
+      // if we'd return a fresh variable every time, developers could easily end up linking just *one* of them to the precondition,
       // while using an unconstrained variable elsewhere, which would create a loophole in the proof.
       if (
         this._contract.cachedVariable !== undefined &&

src/lib/mina/v1/zkapp.ts

@@ -192,7 +192,7 @@ function wrapMethod(
       const { id, context } = SmartContractContext.enter(this, selfAccountUpdate(this, methodName));
       try {
         if (inCompile() || inProver() || inAnalyze()) {
-          // important to run this with a fresh accountUpdate everytime, otherwise compile messes up our circuits
+          // important to run this with a fresh accountUpdate every time, otherwise compile messes up our circuits
           // because it runs this multiple times
           let proverData = inProver() ? zkAppProver.getData() : undefined;
           let txId = Mina.currentTransaction.enter({
@@ -635,7 +635,7 @@ class SmartContract extends SmartContractBase {
   }
 
   /**
-   * Manually set the verificaiton key.
+   * Manually set the verification key.
    */
   static setVerificationKeyUnsafe(verificationKey: { data: string; hash: Field | string }) {
     SmartContract._verificationKey = {
@@ -776,7 +776,7 @@ super.init();
     let inTransaction = Mina.currentTransaction.has();
     let inSmartContract = smartContractContext.get();
     if (!inTransaction && !inSmartContract) {
-      // TODO: it's inefficient to return a fresh account update everytime, would be better to return a constant "non-writable" account update,
+      // TODO: it's inefficient to return a fresh account update every time, would be better to return a constant "non-writable" account update,
       // or even expose the .get() methods independently of any account update (they don't need one)
       return selfAccountUpdate(this);
     }

src/lib/mina/v2/dsl/mina-program.ts

@@ -356,7 +356,7 @@ function proverMethod<
   // methods are invoked externally.
   //
   // We perform shallow evaluation on the roots of account update trees returned by method
-  // invokations. This requires that all child updates were manually applied before invoking the
+  // invocations. This requires that all child updates were manually applied before invoking the
   // method call. Importantly, with this restriction, methods cannot actually generate new
   // children, the children must be passed in as private inputs and constrained accordingly.
   // Unproven update arguments which are not at the root of the tree returned by a method must be

src/lib/mina/v2/state.ts

@@ -470,7 +470,7 @@ const StateValues = {
       (values, preconditions) => {
         for (const i in values.values) {
           if (preconditions.preconditions[i].isSatisfied(values.values[i]).not().toBoolean())
-            throw new Error(`precondition for state field ${i} not satisified`);
+            throw new Error(`precondition for state field ${i} not satisfied`);
         }
       },
       () => {
@@ -495,7 +495,7 @@ const StateValues = {
 
     //   for(const i in state) {
     //     if(statePreconditions.preconditions[i].isSatisfied(state[i]).not().toBoolean())
-    //       throw new Error(`precondition for state field ${i} not satisified`);
+    //       throw new Error(`precondition for state field ${i} not satisfied`);
     //   }
     // } else {
     //   // TODO: evaluate these directly on the custom state representation and give meaningful errors

src/lib/proof-system/proof.ts

@@ -202,7 +202,7 @@ class Proof<Input, Output> extends ProofBase<Input, Output> {
 let sideloadedKeysCounter = 0;
 
 /**
- * The `DynamicProof` class enables circuits to verify proofs using in-ciruit verfication keys.
+ * The `DynamicProof` class enables circuits to verify proofs using in-ciruit verification keys.
  * This is opposed to the baked-in verification keys of the `Proof` class.
  *
  * In order to use this, a subclass of DynamicProof that specifies the public input and output types along with the maxProofsVerified number has to be created.

src/lib/proof-system/zkprogram.ts

@@ -562,7 +562,7 @@ function ZkProgram<
     provers
   );
 
-  // Object.assign only shallow-copies, hence we cant use this getter and have to define it explicitly
+  // Object.assign only shallow-copies, hence we can't use this getter and have to define it explicitly
   Object.defineProperty(program, 'proofsEnabled', {
     get: () => doProving,
   });

src/lib/provable/bigint.ts

@@ -314,7 +314,7 @@ function createProvableBigInt(modulus: bigint, config?: BigIntParameter) {
     /**
      * Subtracts one ProvableBigInt from another
      * Cost: Cheap
-     * @param a The ProvableBigInt to substract
+     * @param a The ProvableBigInt to subtract
      * @returns The difference as a ProvableBigInt
      */
     sub(a: ProvableBigInt_): ProvableBigInt_ {

src/lib/provable/core/fieldvar.ts

@@ -31,7 +31,7 @@ enum FieldType {
 }
 
 /**
- * `FieldVar` is the core data type in snarky. It is eqivalent to `Cvar.t` in OCaml.
+ * `FieldVar` is the core data type in snarky. It is equivalent to `Cvar.t` in OCaml.
  * It represents a field element that is part of provable code - either a constant or a variable.
  *
  * **Variables** end up filling the witness columns of a constraint system.