Almost all large distributed computing projects are trying to solve problems in NP?

Question

Here is a huge list of distributed computing projects: http://distributedcomputing.info/projects.html

After a quick withdrawal, I could not find projects that did not try to solve the problems in NP (version of the search problem). Does anyone know of any projects dealing with things outside the NP?

In addition, are there any distributed computing projects that try to solve problems in classes faster than NP, for example, in P?

I am trying to find out if there is some very general class of search problems, which all or almost all large distributed computing projects are also polynomial. Interestingly, the answer to this question is "something that is NP-complete."

I was not sure what this should be here, but since it includes an understanding of real software, I thought it would be within the scope.