Without taking any stance, here are 8 arguments I made to help you believe that P=NP is possible:
1. Primes is in P
AKS primality test has O(log(n)^6) complexity. Here, the complexity of solving does not increase exponentially with the size of the input. However, multiplication is (either naïvely or correctly?) assumed to be a one-way function.
2. Problems ...