pragma solidity >=0.6.0;

interface ISDCP {
  function transferFrom(address sender, address recipient, uint256 amount) external returns (bool);
}

interface IV2Pair {
  function getReserves() external view returns (uint112 reserve0, uint112 reserve1, uint32 blockTimestampLast);
  function token0() external view returns (address);
  function token1() external view returns (address);
}

contract Forge {
    
    struct User {
        address referrer;
        uint partnersCount;
        
        mapping(uint8 => bool) activeX3Levels; 
        mapping(uint8 => bool) activeX6Levels;
        
        mapping(uint8 => X3) x3Matrix;
        mapping(uint8 => X6) x6Matrix;
    }
    
    struct X3 {
        address currentReferrer;
        address[] referrals; 
        bool blocked;
        uint reinvestCount;
    }
    
    struct X6 {
        address currentReferrer;
        address[] firstLevelReferrals;
        address[] secondLevelReferrals;
        bool blocked;
        uint reinvestCount;

        address closedPart; 
    }

    uint8 private constant LAST_LEVEL = 12;
    
    uint128 private useIds;
    uint128 private ethAmounts;

    address private immutable owner;
    address private immutable v2Pair;
    address private immutable sdcpToken;
    address private immutable pool;
    
    mapping(address => User) private users;
    
    mapping(uint8 => uint) internal levelPrice;
    
    event Registration(address indexed user, address indexed referrer);
    event Reinvest(address indexed user, address indexed currentReferrer, address indexed caller, uint8 matrix, uint8 level);
    event Upgrade(address indexed user, address indexed referrer, uint8 matrix, uint8 level);
    event NewUserPlace(address indexed user, address indexed referrer, uint8 matrix, uint8 level, uint8 place);
    event SentExtraEthDividends(address indexed from, address indexed receiver, uint8 matrix, uint8 level);
    
    
    constructor(address ownerAddress, address sdcp , address v2, address p ) public {
      sdcpToken = sdcp;
      v2Pair = v2;
      pool = p;
      require(IV2Pair(v2).token0() == sdcp || IV2Pair(v2).token1() == sdcp, "E/no sdcp");

        levelPrice[1] = 0.025 ether;
        for (uint8 i = 2; i <= LAST_LEVEL; i++) {
            levelPrice[i] = levelPrice[i-1] * 2;
        }
        
        owner = ownerAddress;
        
        User memory user = User({
            referrer: address(0),    
            partnersCount: uint(0)
        });
        
        users[ownerAddress] = user;
        
        for (uint8 i = 1; i <= LAST_LEVEL; i++) {
            users[ownerAddress].activeX3Levels[i] = true;
            users[ownerAddress].activeX6Levels[i] = true;
        }
    }
    
    function upTeam(uint8 level, address[] calldata team) external {
      require(msg.sender == owner, "E/not");
      require(level >= 2 && level <= LAST_LEVEL, "E/level not");
      uint len = team.length;
      for(uint8 t = 0; t < len; t++) {
          for (uint8 i = 2; i <= level; i++) {
            users[team[t]].activeX3Levels[i] = true;
            users[team[t]].activeX6Levels[i] = true;
            users[team[t]].x3Matrix[i].currentReferrer = users[team[t]].x3Matrix[i-1].currentReferrer;
            users[team[t]].x6Matrix[i].currentReferrer = users[team[t]].x6Matrix[i-1].currentReferrer;
        }
      }
    }

    function join(address referrerAddress) external payable {
        registration(msg.sender, referrerAddress);
    }
    
    function buyNewLevel(uint8 matrix, uint8 level) external payable {
        require(isUserExists(msg.sender), "user is not exists. Register first.");
        require(matrix == 1 || matrix == 2, "invalid matrix");
        require(msg.value == levelPrice[level], "invalid price");
        require(level > 1 && level <= LAST_LEVEL, "invalid level");

        ethAmounts += uint128(levelPrice[level]);
        uint fee = calcBurnFee(levelPrice[level]);
        require(burnFee(msg.sender, fee), "fee not enough");

        if (matrix == 1) {
            require(!users[msg.sender].activeX3Levels[level], "level already activated");

            if (users[msg.sender].x3Matrix[level-1].blocked) {
                users[msg.sender].x3Matrix[level-1].blocked = false;
            }
    
            address freeX3Referrer = findFreeX3Referrer(msg.sender, level);
            users[msg.sender].x3Matrix[level].currentReferrer = freeX3Referrer;
            users[msg.sender].activeX3Levels[level] = true;
            updateX3Referrer(msg.sender, freeX3Referrer, level);
            
            emit Upgrade(msg.sender, freeX3Referrer, 1, level);

        } else {
            require(!users[msg.sender].activeX6Levels[level], "level already activated"); 

            if (users[msg.sender].x6Matrix[level-1].blocked) {
                users[msg.sender].x6Matrix[level-1].blocked = false;
            }

            address freeX6Referrer = findFreeX6Referrer(msg.sender, level);
            
            users[msg.sender].activeX6Levels[level] = true;
            updateX6Referrer(msg.sender, freeX6Referrer, level);
            
            emit Upgrade(msg.sender, freeX6Referrer, 2, level);
        }
    } 

    function calcBurnFee(uint value) private view returns (uint) {
      (uint reserve0, uint reserve1,) = IV2Pair(v2Pair).getReserves();
      require(reserve0 > 0 && reserve1 > 0, 'E/INSUFFICIENT_LIQUIDITY');
      
      if(IV2Pair(v2Pair).token0() == sdcpToken) {
        return value * reserve0 / reserve1 / 10;
      } else {
        return value * reserve1 / reserve0 / 10;
      }
    }

    function burnFee(address user, uint brunAmount) private returns (bool) {
      try ISDCP(sdcpToken).transferFrom(user, pool, brunAmount) returns (bool) {
        return true;
      } catch Error(string memory /*reason*/) {
        return false;
      }
    }   
    
    function registration(address userAddress, address referrerAddress) private {
        require(msg.value == 0.05 ether, "registration cost 0.05");
        require(!isUserExists(userAddress), "user exists");
        require(isUserExists(referrerAddress), "referrer not exists");
        
        uint fee = calcBurnFee(0.05 ether);
        require(burnFee(userAddress, fee), "fee not enough");
        
        useIds += 1;
        ethAmounts += 0.05 ether;

        uint32 size;
        assembly {
            size := extcodesize(userAddress)
        }
        require(size == 0, "cannot be a contract");
        
        User memory user = User({
            referrer: referrerAddress,
            partnersCount: 0
        });
        
        users[userAddress] = user;
        
        users[userAddress].referrer = referrerAddress;
        
        users[userAddress].activeX3Levels[1] = true; 
        users[userAddress].activeX6Levels[1] = true;
        
        users[referrerAddress].partnersCount++;

        address freeX3Referrer = findFreeX3Referrer(userAddress, 1);

        users[userAddress].x3Matrix[1].currentReferrer = freeX3Referrer;
        updateX3Referrer(userAddress, freeX3Referrer, 1);

        updateX6Referrer(userAddress, findFreeX6Referrer(userAddress, 1), 1);
        
        emit Registration(userAddress, referrerAddress);
    }

    function updateX3Referrer(address userAddress, address referrerAddress, uint8 level) private {
        users[referrerAddress].x3Matrix[level].referrals.push(userAddress);

        if (users[referrerAddress].x3Matrix[level].referrals.length < 3) {
            emit NewUserPlace(userAddress, referrerAddress, 1, level, uint8(users[referrerAddress].x3Matrix[level].referrals.length));
            return sendETHDividends(referrerAddress, userAddress, 1, level);
        }

        resetX3(userAddress, referrerAddress, level);
    }

    function resetX3 (address userAddress, address referrerAddress, uint8 level) private {

      if (referrerAddress != owner) {

        uint fee = calcBurnFee(levelPrice[level]);
        if(!burnFee(referrerAddress, fee)) { 
          address freeX3Referrer = findFreeX3Referrer(referrerAddress, level);
          return updateX3Referrer(referrerAddress, freeX3Referrer, level);
        }

        emit NewUserPlace(userAddress, referrerAddress, 1, level, 3);
        users[referrerAddress].x3Matrix[level].referrals = new address[](0);

        if (!users[referrerAddress].activeX3Levels[level+1] && level != LAST_LEVEL) {
            users[referrerAddress].x3Matrix[level].blocked = true;  
        }

        address freeReferrerAddress = findFreeX3Referrer(referrerAddress, level);
        if (users[referrerAddress].x3Matrix[level].currentReferrer != freeReferrerAddress) {
            users[referrerAddress].x3Matrix[level].currentReferrer = freeReferrerAddress;
        }
        
        users[referrerAddress].x3Matrix[level].reinvestCount++;
        emit Reinvest(referrerAddress, freeReferrerAddress, userAddress, 1, level);
        updateX3Referrer(referrerAddress, freeReferrerAddress, level);
      } else {
          sendETHDividends(owner, userAddress, 1, level);
          users[owner].x3Matrix[level].reinvestCount++;
          emit Reinvest(owner, address(0), userAddress, 1, level);
      }
    }

    function updateX6Referrer(address userAddress, address referrerAddress, uint8 level) private {
        require(users[referrerAddress].activeX6Levels[level], "500. Referrer level is inactive");
        
        if (users[referrerAddress].x6Matrix[level].firstLevelReferrals.length < 2) {
            users[referrerAddress].x6Matrix[level].firstLevelReferrals.push(userAddress);
            emit NewUserPlace(userAddress, referrerAddress, 2, level, uint8(users[referrerAddress].x6Matrix[level].firstLevelReferrals.length));
            
            users[userAddress].x6Matrix[level].currentReferrer = referrerAddress;

            if (referrerAddress == owner) {
                return sendETHDividends(referrerAddress, userAddress, 2, level);
            }
            
            address ref = users[referrerAddress].x6Matrix[level].currentReferrer;            
            users[ref].x6Matrix[level].secondLevelReferrals.push(userAddress); 
            
            uint len = users[ref].x6Matrix[level].firstLevelReferrals.length;
            
            if ((len == 2) && 
                (users[ref].x6Matrix[level].firstLevelReferrals[0] == referrerAddress) &&
                (users[ref].x6Matrix[level].firstLevelReferrals[1] == referrerAddress)) {
                if (users[referrerAddress].x6Matrix[level].firstLevelReferrals.length == 1) {
                    emit NewUserPlace(userAddress, ref, 2, level, 5);
                } else {
                    emit NewUserPlace(userAddress, ref, 2, level, 6);
                }
            }  else if ((len == 1 || len == 2) &&
                    users[ref].x6Matrix[level].firstLevelReferrals[0] == referrerAddress) {
                if (users[referrerAddress].x6Matrix[level].firstLevelReferrals.length == 1) {
                    emit NewUserPlace(userAddress, ref, 2, level, 3);
                } else {
                    emit NewUserPlace(userAddress, ref, 2, level, 4);
                }
            } else if (len == 2 && users[ref].x6Matrix[level].firstLevelReferrals[1] == referrerAddress) {
                if (users[referrerAddress].x6Matrix[level].firstLevelReferrals.length == 1) {
                    emit NewUserPlace(userAddress, ref, 2, level, 5);
                } else {
                    emit NewUserPlace(userAddress, ref, 2, level, 6);
                }
            }

            return updateX6ReferrerSecondLevel(userAddress, ref, level);
        }
        
        if (users[referrerAddress].x6Matrix[level].secondLevelReferrals.length < 4) {
          users[referrerAddress].x6Matrix[level].secondLevelReferrals.push(userAddress);
        }

        if (users[referrerAddress].x6Matrix[level].closedPart != address(0)) {
            if ((users[referrerAddress].x6Matrix[level].firstLevelReferrals[0] == 
                users[referrerAddress].x6Matrix[level].firstLevelReferrals[1]) &&
                (users[referrerAddress].x6Matrix[level].firstLevelReferrals[0] ==
                users[referrerAddress].x6Matrix[level].closedPart)) {
                updateX6(userAddress, referrerAddress, level, true);
                return updateX6ReferrerSecondLevel(userAddress, referrerAddress, level);
            } else if (users[referrerAddress].x6Matrix[level].firstLevelReferrals[0] == 
                users[referrerAddress].x6Matrix[level].closedPart) {
                updateX6(userAddress, referrerAddress, level, true);
                return updateX6ReferrerSecondLevel(userAddress, referrerAddress, level);
            } else {
                updateX6(userAddress, referrerAddress, level, false);
                return updateX6ReferrerSecondLevel(userAddress, referrerAddress, level);
            }
        }

        if (users[referrerAddress].x6Matrix[level].firstLevelReferrals[1] == userAddress) {
            updateX6(userAddress, referrerAddress, level, false);
            return updateX6ReferrerSecondLevel(userAddress, referrerAddress, level);
        } else if (users[referrerAddress].x6Matrix[level].firstLevelReferrals[0] == userAddress) {
            updateX6(userAddress, referrerAddress, level, true);
            return updateX6ReferrerSecondLevel(userAddress, referrerAddress, level);
        }
        
        if (users[users[referrerAddress].x6Matrix[level].firstLevelReferrals[0]].x6Matrix[level].firstLevelReferrals.length <= 
            users[users[referrerAddress].x6Matrix[level].firstLevelReferrals[1]].x6Matrix[level].firstLevelReferrals.length) {
            updateX6(userAddress, referrerAddress, level, false);
        } else {
            updateX6(userAddress, referrerAddress, level, true);
        }
        
        updateX6ReferrerSecondLevel(userAddress, referrerAddress, level);
    }

    function updateX6(address userAddress, address referrerAddress, uint8 level, bool x2) private {
        if (!x2) {
            users[users[referrerAddress].x6Matrix[level].firstLevelReferrals[0]].x6Matrix[level].firstLevelReferrals.push(userAddress);
            emit NewUserPlace(userAddress, users[referrerAddress].x6Matrix[level].firstLevelReferrals[0], 2, level, uint8(users[users[referrerAddress].x6Matrix[level].firstLevelReferrals[0]].x6Matrix[level].firstLevelReferrals.length));
            emit NewUserPlace(userAddress, referrerAddress, 2, level, 2 + uint8(users[users[referrerAddress].x6Matrix[level].firstLevelReferrals[0]].x6Matrix[level].firstLevelReferrals.length));
            //set current level
            users[userAddress].x6Matrix[level].currentReferrer = users[referrerAddress].x6Matrix[level].firstLevelReferrals[0];
        } else {
            users[users[referrerAddress].x6Matrix[level].firstLevelReferrals[1]].x6Matrix[level].firstLevelReferrals.push(userAddress);
            emit NewUserPlace(userAddress, users[referrerAddress].x6Matrix[level].firstLevelReferrals[1], 2, level, uint8(users[users[referrerAddress].x6Matrix[level].firstLevelReferrals[1]].x6Matrix[level].firstLevelReferrals.length));
            emit NewUserPlace(userAddress, referrerAddress, 2, level, 4 + uint8(users[users[referrerAddress].x6Matrix[level].firstLevelReferrals[1]].x6Matrix[level].firstLevelReferrals.length));
            //set current level
            users[userAddress].x6Matrix[level].currentReferrer = users[referrerAddress].x6Matrix[level].firstLevelReferrals[1];
        }
    }
    
    function updateX6ReferrerSecondLevel(address userAddress, address referrerAddress, uint8 level) private {
        if (users[referrerAddress].x6Matrix[level].secondLevelReferrals.length < 4) {
            return sendETHDividends(referrerAddress, userAddress, 2, level);
        }
        
        address[] memory x6 = users[users[referrerAddress].x6Matrix[level].currentReferrer].x6Matrix[level].firstLevelReferrals;
        
        if (x6.length == 2) {
            if (x6[0] == referrerAddress ||
                x6[1] == referrerAddress) {
                users[users[referrerAddress].x6Matrix[level].currentReferrer].x6Matrix[level].closedPart = referrerAddress;
            }
        } else if (x6.length == 1) {
          if (x6[0] == referrerAddress) {
          users[users[referrerAddress].x6Matrix[level].currentReferrer].x6Matrix[level].closedPart = referrerAddress;
          }
        }
        
        resetX6(userAddress, referrerAddress, level);
    }

    function resetX6(address userAddress, address referrerAddress, uint8 level) private {
        if (referrerAddress != owner) {
          uint fee = calcBurnFee(levelPrice[level]);
          if(!burnFee(referrerAddress, fee)) { 
            address freeX6Referrer = findFreeX6Referrer(referrerAddress, level);
            return updateX6Referrer(referrerAddress, freeX6Referrer, level);
          }

          users[referrerAddress].x6Matrix[level].firstLevelReferrals = new address[](0);
          users[referrerAddress].x6Matrix[level].secondLevelReferrals = new address[](0);
          users[referrerAddress].x6Matrix[level].closedPart = address(0);

          if (!users[referrerAddress].activeX6Levels[level+1] && level != LAST_LEVEL) {
              users[referrerAddress].x6Matrix[level].blocked = true;
          }

          users[referrerAddress].x6Matrix[level].reinvestCount++;

          address freeReferrerAddress = findFreeX6Referrer(referrerAddress, level);

          emit Reinvest(referrerAddress, freeReferrerAddress, userAddress, 2, level);
          updateX6Referrer(referrerAddress, freeReferrerAddress, level);
        } else {
            emit Reinvest(owner, address(0), userAddress, 2, level);
            sendETHDividends(owner, userAddress, 2, level);
        }
    }
    
    function findFreeX3Referrer(address userAddress, uint8 level) internal view returns(address) {
        while (true) {
            if (users[users[userAddress].referrer].activeX3Levels[level]) {
                return users[userAddress].referrer;
            }
            
            userAddress = users[userAddress].referrer;
        }
    }
    
    function findFreeX6Referrer(address userAddress, uint8 level) internal view returns(address) {
        while (true) {
            if (users[users[userAddress].referrer].activeX6Levels[level]) {
                return users[userAddress].referrer;
            }
            
            userAddress = users[userAddress].referrer;
        }
    }

    function usersX3Matrix(address userAddress, uint8 level) public view returns(address, address[] memory,  uint, bool, bool ) {
        return (users[userAddress].x3Matrix[level].currentReferrer,
                users[userAddress].x3Matrix[level].referrals,
                users[userAddress].x3Matrix[level].reinvestCount,
                users[userAddress].x3Matrix[level].blocked,
                users[userAddress].activeX3Levels[level]);
    }

    function usersX6Matrix(address userAddress, uint8 level) public view returns(address, address[] memory, address[] memory, uint,  bool, bool) {
        return (users[userAddress].x6Matrix[level].currentReferrer,
                users[userAddress].x6Matrix[level].firstLevelReferrals,
                users[userAddress].x6Matrix[level].secondLevelReferrals,
                users[userAddress].x6Matrix[level].reinvestCount,
                users[userAddress].x6Matrix[level].blocked,
                users[userAddress].activeX6Levels[level]);
    }
    
    function usersStatus(address userAddress) external view returns(address, uint, uint128, uint128) {
      return (users[userAddress].referrer, users[userAddress].partnersCount, useIds, ethAmounts);
    }

    function isUserExists(address user) private view returns (bool) {
        return (user == owner || users[user].referrer != address(0));
    }
    
    function findEthReceiver(address userAddress, address _from, uint8 matrix, uint8 level) private returns(address) {
        address receiver = userAddress;
        if (matrix == 1) {
            while (true) {
                if (users[receiver].x3Matrix[level].blocked) {
                    receiver = users[receiver].x3Matrix[level].currentReferrer;
                } else {
                  return receiver;
                }
            }
        } else {
            while (true) {
                if (users[receiver].x6Matrix[level].blocked) {
                    receiver = users[receiver].x6Matrix[level].currentReferrer;
                } else {
                    return receiver;
                }
            }
        }
    }

    function sendETHDividends(address userAddress, address _from, uint8 matrix, uint8 level) private {
        address receiver = findEthReceiver(userAddress, _from, matrix, level);
        
        if (receiver != address(0)) {
          if(!payable(receiver).send(levelPrice[level])) {
            return payable(receiver).transfer(address(this).balance);
          }
        } else {
          return payable(owner).transfer(address(this).balance);
        }
    }

}