Fix typos

Author: rex4539

README.md

@@ -76,7 +76,7 @@ The libsnark library currently provides a C++ implementation of:
        contribution of \[DFGK14]
     4. A preprocessing SNARK for a language of Boolean circuits, "TBCS"
        (_Two-input Boolean Circuit Satisfiability_). Internally, it reduces to USCS.
-       This is much more  efficient than going through R1CS.
+       This is much more efficient than going through R1CS.
     5. A simulation-extractable preprocessing SNARK for R1CS.
        This construction uses the approach described in \[GM17]. For arithmetic
        circuits, it is slower than the \[BCTV14a] approach, but produces shorter
@@ -298,7 +298,7 @@ This will install `libsnark.a` into `/install/path/lib`; so your application sho
 
 In addition, unless you use `WITH_SUPERCOP=OFF`, `libsnark_adsnark.a` will be installed and should be linked in using `-lsnark_adsnark`.
 
-When you use compile you application against `libsnark`, you must have the same conditional defines (`#define FOO` or `g++ -DFOO`) as when you compiled `libsnark`, due to the use of templates. One way to figure out the correct conditional defines is to look at `build/libsnark/CMakeFiles/snark.dir/flags.make` after running `cmake`. ([Issue #21](https://github.com/scipr-lab/libsnark/issues/21))
+When you use compile your application against `libsnark`, you must have the same conditional defines (`#define FOO` or `g++ -DFOO`) as when you compiled `libsnark`, due to the use of templates. One way to figure out the correct conditional defines is to look at `build/libsnark/CMakeFiles/snark.dir/flags.make` after running `cmake`. ([Issue #21](https://github.com/scipr-lab/libsnark/issues/21))
 
 ### Building on Windows using Cygwin
 

libsnark/common/data_structures/integer_permutation.hpp

@@ -41,7 +41,7 @@ class integer_permutation {
     integer_permutation slice(const size_t slice_min_element, const size_t slice_max_element) const;
 
     /* Similarly to std::next_permutation this transforms the current
-    integer permutation into the next lexicographically oredered
+    integer permutation into the next lexicographically ordered
     permutation; returns false if the last permutation was reached and
     this is now the identity permutation on [min_element .. max_element] */
     bool next_permutation();

libsnark/common/data_structures/merkle_tree.tcc

@@ -138,7 +138,7 @@ merkle_tree<HashT>::merkle_tree(const size_t depth,
                     }
                     else
                     {
-                        // typical case: this is the left child of the parent and adjecent to it there is a right child
+                        // typical case: this is the left child of the parent and adjacent to it there is a right child
                         hashes[(idx-1)/2] = two_to_one_CRH<HashT>(hash, std::next(it)->second);
                         ++it;
                     }

libsnark/common/data_structures/sparse_vector.hpp

@@ -57,7 +57,7 @@ struct sparse_vector {
     size_t size() const; // return the number of indices (representing the number of non-zero entries)
     size_t size_in_bits() const; // return the number bits needed to store the sparse vector
 
-    /* return a pair consisting of the accumulated value and the sparse vector of non-accumuated values */
+    /* return a pair consisting of the accumulated value and the sparse vector of non-accumulated values */
     template<typename FieldT>
     std::pair<T, sparse_vector<T> > accumulate(const typename std::vector<FieldT>::const_iterator &it_begin,
                                                const typename std::vector<FieldT>::const_iterator &it_end,

libsnark/common/libsnark_serialization.hpp

@@ -1,7 +1,7 @@
 /** @file
  *****************************************************************************
 
- Temporary import serialization operators from libff in libsnark namspace;
+ Temporary import serialization operators from libff in libsnark namespace;
 
  *****************************************************************************
  * @author     This file is part of libsnark, developed by SCIPR Lab

libsnark/common/routing_algorithms/as_waksman_routing_algorithm.cpp

@@ -147,7 +147,7 @@ void construct_as_waksman_inner(const size_t left,
             /**
              * Odd special case:
              * the last wire is not connected to any switch,
-             * and the the wire is mereley routed "straight".
+             * and the wire is merely routed "straight".
              */
             neighbors[left][hi].first = neighbors[left][hi].second = hi;
             neighbors[right][hi].first = neighbors[right][hi].second = rhs_dests[hi-lo];

libsnark/common/routing_algorithms/benes_routing_algorithm.cpp

@@ -265,7 +265,7 @@ benes_routing get_benes_routing(const integer_permutation &permutation)
     return routing;
 }
 
-/* auxuliary function that is used in valid_benes_routing below */
+/* auxiliary function that is used in valid_benes_routing below */
 template<typename T>
 std::vector<std::vector<T> > route_by_benes(const benes_routing &routing, const std::vector<T> &start)
 {

libsnark/gadgetlib1/gadgets/cpu_checkers/fooram/components/bar_gadget.tcc

@@ -1,7 +1,7 @@
 /** @file
  *****************************************************************************
 
- Implementation of interfaces for an auxiliarry gadget for the FOORAM CPU.
+ Implementation of interfaces for an auxiliary gadget for the FOORAM CPU.
 
  See bar_gadget.hpp .
 

libsnark/gadgetlib1/gadgets/hashes/knapsack/knapsack_gadget.hpp

@@ -18,7 +18,7 @@
  In both cases, a method ("sample_randomness") allows to sample M.
 
  The parameter d (the dimension) is fixed at compile time in the struct
- knapsack_dimension below. The parameter m (the input lenght) can be chosen
+ knapsack_dimension below. The parameter m (the input length) can be chosen
  at run time (in either gadget).
 
 

libsnark/gadgetlib2/adapters.cpp

@@ -67,7 +67,7 @@ This limitation is to prevent a logic bug that may occur if the variables used a
 The indices are assigned on the Variable constructor, using the global variable nextFreeIndex. Thus, creating two protoboards in the same program may cause
 unexpected behavior when converting.
 Moreover, the bug will create more variables than needed in the converted system, e.g. if variables 0,1,3,4 were used in the gadgetlib2
-generated system, than the conversion will create a new r1cs system with variables 0,1,2,3,4 and assign variable 2 the value zero
+generated system, then the conversion will create a new r1cs system with variables 0,1,2,3,4 and assign variable 2 the value zero
 (when converting the assignment).
 Everything should be fixed soon.
 If you are sure you know what you are doing, you can comment out the ASSERT line.