Merge branch 'main' into main

Author: Cashmaney

docs/devdocs/Examples and References/Examples-fheDapps.md

@@ -39,8 +39,9 @@ Here you can find a list of some of cool apps that you can use as a reference
 <td>This examples will need to be updated when using Fhenix's FHE.sol</td>
 </tr>
 <tr>
-<td>Private Voting</td>
-<td><a href="https://www.fhenix.io">TO BE ADDED</a></td>
+<td>Confidential Voting</td>
+<td><a href="https://github.com/FhenixProtocol/confidential-voting">https://github.com/FhenixProtocol/confidential-voting</a></td>
+<td></td>
 <td></td>
 </tr>
 <tr>
@@ -55,4 +56,3 @@ Here you can find a list of some of cool apps that you can use as a reference
 </tr>
 </tbody>
 </table>
-

docs/devdocs/Solidity API/Utilities.md

@@ -2,7 +2,7 @@
 
 #### Encrypted Address
 
-Encrypting address is not an easy task as we currently only support encrypted uint32s (4 bytes) and address are formed out of 20 bytes.
+Encrypting an address is not an easy task as we currently only support encrypted uint32s (4 bytes) and address are formed out of 20 bytes.
 We created a tool that implements `Eaddress` which is formed by 5 uint32s.
 This utility allows you to do some operations on encrypted addresses.
 The tool can be imported from: TBD
@@ -11,10 +11,10 @@ An example of how to use the tool can be found it: TBD
 #### Random Number
 
 Confidentiality is a crucial step in order to achieve on-chain randomness. Fhenix, as a chain that implements confidentiality, is a great space to implement and use on-chain random numbers and this is part of our roadmap.
-We know that there are some #BUIDLers that are planning to implement dapps that leverage both confidentiality and random numbers so until we will have on-chain true random we are suggesting to use the following implementation as a MOCKUP.
+We know that there are some #BUIDLers that are planning to implement dapps that leverage both confidentiality and random numbers so until we will have on-chain true random, we are suggesting to use the following implementation as a MOCKUP.
 PLEASE NOTE THAT THIS RANDOM NUMBER IS VERY PREDICTABLE AND CAN'T BE REALLY TRUSTED
 
-```javascript
+```solidity
 library RandomMock {
     function getFakeRandom() internal returns (uint256) {
         uint blockNumber = block.number;

docs/devdocs/Tips/Useful-Tips.md

@@ -8,15 +8,17 @@ When we are using `FHE.asEuint*(PLAINTEXT_NUMBER)` we are actually using a trivi
 
 #### Default Value of a Euint
 
-When having a `euint*` variable uninitialized it will be considered as 0. Every FHE function that will receive an unitialized euint* will assume it is `FHE.asEuint*(0)`.
-You can assume now that `FHE.asEuint*(0)`is quite oftenly used - Luckily we realized this and decided to have the values of`FHE.asEuint*(0)`pre-calculated on node initialization so when you use`FHE.asEuint\*(0)` we will just return those values.
+When having a `euint*` variable uninitialized it will be considered as 0. Every FHE function that will receive an uninitialized euint* will assume it is `FHE.asEuint*(0)`.
+You can assume now that `FHE.asEuint*(0)`is used quite often - Luckily we realized this and decided to have the values of`FHE.asEuint*(0)`pre-calculated on node initialization so when you use`FHE.asEuint\*(0)` we will just return those values.
 
 #### Re-encrypting a Value
 
 To explain this tip we will use an example. Let's assume we want to develop a confidential voting and let's say we have 4 candidates.
 Assuming that on each vote we increase (cryptographically with FHE.add) the tally, one can just monitor the key in the DB that represents this specific tally and once the key was changes he will know who we voted for.
 An ideal solution for this issue is to change all keys no matter who we voted for, but how?!
-In order to understand how we will first need to understand that FHE encryption is a non-determenisitic encryption means that encrypting (non-trivial encryption) a number twice will result with 2 different encrypted outputs.
+
+In order to understand how we will first need to understand that FHE encryption is a non-deterministic encryption means that encrypting (non-trivial encryption) a number twice will result with 2 different encrypted outputs.
+
 Now that we know that, we can add 0 (cryptographically with FHE.add) to all of those tallies that shouldn't be changed and they will be changed in the DB!
 
 #### FHE.req() in TXs
@@ -25,7 +27,8 @@ All of the operations are supported both in TXs and in Queries. That being said
 
 #### Performance and Gas Usage
 
-Currently we are supporting a lot of FHE operations. Some of them might take a lot of time to compute, some good examples are: Div (5 seconds for euint32), Mul, Rem, and the time will grow depends on the value types you are using.
+Currently we support many FHE operations. Some of them might take a lot of time to compute, some good examples are: Div (5 seconds for euint32), Mul, Rem, and the time will grow depends on the value types you are using.
+
 When writing FHE code we encourage you to use the operations wisely and choose what operation should be used.
 Example: Instead of `FHE.mul(ENCRYPTED_UINT_32, FHE.asEuint32(2))` you can use `FHE.shl(ENCRYPTED_UINT_32, FHE.asEuint32(1))` in some cases `FHE.div(ENCRYPTED_UINT_32, FHE.asEuint32(2))` can be replaced by `FHE.shr(ENCRYPTED_UINT_32, FHE.asEuint32(1))`
 

docs/devdocs/Tools and Utilities/Fhenix-Remix-Plugin.md

@@ -15,6 +15,6 @@ After deploying the contract (The plugin is only aware of contracts that are dep
 * Interact with the contract - On contract interaction you should use the values that were encrypted by the plugin for encrypted inputs. For contracts that are returning an output of a sealOutput function, the plugin will already generate a public address and it will decrypt the output for you.
 
 #### Known Issues
-* Sometimes the plugin isn't using the correct permit - You should open the `Permit Management` tab and choose another permit and then rechoose the right permit
+* Sometimes the plugin isn't using the correct permit - You should open the `Permit Management` tab and choose another permit and then re-choose the right permit
 * Sometimes the "Encrypt" button remains unclickable - You can right click on the frame and choose `Reload frame`
 * On contract interaction when the contract receives a public key the plugin generate public key which starts with `0x0x` - Remove one of them

docs/devdocs/Writing Smart Contracts/Permissions.md

@@ -18,7 +18,7 @@ To utilize the `Permissioned` contract, you would inherit it in your own contrac
 
 1. Define a view function in your contract. For example, to retrieve sensitive data:
 
-    ```javascript
+    ```solidity
     function getSensitiveData(Permission calldata perm) public view onlySender(perm) returns (string memory) {
         // Logic to return sensitive data
     }

docs/devdocs/Writing Smart Contracts/Returning-Data.md

@@ -27,7 +27,7 @@ There are two ways to return encrypted data to the user:
 
 ### Sealed Box Encryption
 
-```Javascript
+```solidity
 import {FHE} from "@fhenixprotocol/contracts";
 
 function sealoutputExample(bytes32 pubkey) public pure returns (bytes memory reencrypted) {

docs/devdocs/Writing Smart Contracts/booleans.md

@@ -9,7 +9,8 @@ description: Comparisons on FHE data
 ## Comparisons
 
 Unlike other operations in FHE.sol, comparison operations do not support their respective operators (e.g. `>`, `<` etc.). 
-This is because solidity expects these operators to return a boolean value, which is not possible with FHE. Intuitively, this is because returning a boolean value would leak information about the encrypted data.
+This is because solidity expects these operators to return a boolean value, which is not possible with FHE.
+Intuitively, this is because returning a boolean value would leak information about the encrypted data.
 
 Instead, comparison operations are implemented as functions that return an `ebool` type.