I'm learning about cryptographic hash functions and know why certain boolean functions were chosen to be used in the compression function of cryptographic hash functions (older question).
Hash functions like MD5, SHA-1 and SHA-2 all use boolean function with three inputs. However, SHA-2 uses two functions per round.
SHA-2 uses the following functions in every round:
$f_{1}(B,C,D)=(B\wedge C)\lor(D\wedge \lnot B)$
$f_{2}(B,C,D)=(B\wedge C)\oplus(B\wedge D)\oplus(C\wedge D)$
I do not understand why boolean functions with three inputs are used. Why not use a boolean function with 4, 5 or 6 inputs? Why does SHA-2 use two three valued functions per round, why not one six valued function? If the functions are balanced, good for diffusion and not fully linear, it should not make a difference.