We prove that the number of primes in an interval of length N is at most 2N Log N when N is large enough This is obtained through a sieving process which can be seen as a hybrid between the large sieve and the Selberg sieve and draws on what we call ”local models”