EthFiddle - Solidity IDE in the Browser. Powered By Loom Network

// SPDX - License-Identifier:MIT
pragma solidity^0.8.0;
contract MemoryHardAlgorithm{
  uint public difficulty; //difficulty level for the memory-hard proof
  uint public iterations; //Number of iterations for memory- hard Computations
  constructor(uint_difficulty,uint_iterations){
    difficulty=_difficulty;
    iterations=_iterations;
  }
// Function to start the memory-hard proof-of-work process
function memoryHardWork(bytes32 seed) external view returns(bytes32){

//create a dynamic array to store memory-hard proof values
  bytes32[] memoryProofArray=new bytes32[](iterations);

// Seed the array with intial value(pseudo random)
  proofArray[0]=keccak256(abi.encodPacked(block.timestamp,block.difficulty,seed));

//iteratively populate the array
  for(uint=1;i<iterations;i++){
    //create a new value based on the previous one and block information
    proofArray[i]=keccak256(abi,encodePacked(proofArray[i-1],block,timestamp,block difficulty));
  }
  //combine all proof values to create the final proof hash
  byte32 finalProof=keccak256(abi.encodePacked(proof[Array[iterations-1]],block,timestamp));

//Check if the proof meets difficulty target
  require(uint256(finalProof)<difficulty,"Prof doesn't meet difficulty requirements"); 
  return finalProof;                                                                        
}  
}