Typical forcings, NP search problems and an extension of a theorem of Riis

We define typical forcings encompassing many informal forcing arguments in bounded arithmetic and give general conditions for such forcings to produce models of the universal variant of relativized T21. We apply this result to study the relative complexity of total (type 2) NP search problems associated to finitary combinatorial principles.