Formatter Update

contracts/EthStorageUpgradeableProxy.sol

@@ -4,11 +4,10 @@ pragma solidity ^0.8.20;
 import "@openzeppelin/contracts/proxy/transparent/TransparentUpgradeableProxy.sol";
 
 contract EthStorageUpgradeableProxy is TransparentUpgradeableProxy {
-    constructor(
-        address _logic,
-        address initialOwner,
-        bytes memory _data
-    ) payable TransparentUpgradeableProxy(_logic, initialOwner, _data) {}
+    constructor(address _logic, address initialOwner, bytes memory _data)
+        payable
+        TransparentUpgradeableProxy(_logic, initialOwner, _data)
+    {}
 
     function admin() public view virtual returns (address) {
         return ERC1967Utils.getAdmin();

contracts/Interfaces/IProxyAdmin.sol

@@ -4,9 +4,7 @@ pragma solidity ^0.8.20;
 import {ITransparentUpgradeableProxy} from "@openzeppelin/contracts/proxy/transparent/TransparentUpgradeableProxy.sol";
 
 interface IProxyAdmin {
-    function upgradeAndCall(
-        ITransparentUpgradeableProxy proxy,
-        address implementation,
-        bytes memory data
-    ) external payable;
+    function upgradeAndCall(ITransparentUpgradeableProxy proxy, address implementation, bytes memory data)
+        external
+        payable;
 }

contracts/StorageContract.sol

@@ -84,7 +84,7 @@ abstract contract StorageContract is DecentralizedKV {
     /// @notice Fund tracker for prepaid
     uint256 public accPrepaidAmount;
 
-    /// @notice Reentrancy lock 
+    /// @notice Reentrancy lock
     bool private transient locked;
 
     // TODO: Reserve extra slots (to a total of 50?) in the storage layout for future upgrades

contracts/libraries/MerkleLib.sol

@@ -74,12 +74,11 @@ library MerkleLib {
     }
 
     // Verify the if the hash of a chunk data is in the chunks
-    function verify(
-        bytes32 dataHash,
-        uint256 chunkIdx,
-        bytes32 root,
-        bytes32[] memory proofs
-    ) internal pure returns (bool) {
+    function verify(bytes32 dataHash, uint256 chunkIdx, bytes32 root, bytes32[] memory proofs)
+        internal
+        pure
+        returns (bool)
+    {
         bytes32 hash = dataHash;
         uint256 nChunkBits = proofs.length;
         require(chunkIdx < (1 << nChunkBits), "chunkId overflows");
@@ -95,11 +94,11 @@ library MerkleLib {
         return hash == root;
     }
 
-    function calculateRootWithProof(
-        bytes32 dataHash,
-        uint256 chunkIdx,
-        bytes32[] memory proofs
-    ) internal pure returns (bytes32) {
+    function calculateRootWithProof(bytes32 dataHash, uint256 chunkIdx, bytes32[] memory proofs)
+        internal
+        pure
+        returns (bytes32)
+    {
         bytes32 hash = dataHash;
         uint256 nChunkBits = proofs.length;
         require(chunkIdx < (1 << nChunkBits), "chunkId overflows");
@@ -115,12 +114,11 @@ library MerkleLib {
         return hash;
     }
 
-    function getProof(
-        bytes memory data,
-        uint256 chunkSize,
-        uint256 nChunkBits,
-        uint256 chunkIdx
-    ) internal pure returns (bytes32[] memory) {
+    function getProof(bytes memory data, uint256 chunkSize, uint256 nChunkBits, uint256 chunkIdx)
+        internal
+        pure
+        returns (bytes32[] memory)
+    {
         uint256 nChunks = 1 << nChunkBits;
         require(chunkIdx < nChunks, "index out of scope");
         bytes32[] memory nodes = new bytes32[](nChunks);