Solution:
Let B=b1b2⋯b7−128. Since
a1b1b2⋯b7≡a22b2b3⋯b7≡a34b3b4⋯b7≡⋯≡a1128(mod167)
we find that a1B≡1(mod167). Similarly, aiB≡1(mod167) for all i. Since 167 is a prime and 167−1=2⋅83, we know that the order of each individual ai (since ai=1) must be either 2 or a multiple of 83. If B is not a multiple of 83, then it follows that all the ai must be −1, which implies that all the bi must be even, meaning that the minimum possible value of b1b2⋯b7(b1+b2+⋯+b7) is 27⋅14>1000.
On the other hand, if B is a multiple of 83, then the smallest possible values for b1b2⋯b7 are 45 and 128. If b1b2⋯b7=45, then the smallest possible value for b1+b2+⋯+b7 is 5+3+3+1+1+1+1=15, so the minimum possible value for b1b2⋯b7(b1+b2+⋯+b7) is 45⋅15=675. This can be achieved by letting g be an element of order 83 and setting a1=g, a2=g1/2, a3=g1/4, a4=g1/8, a5=g1/16, a6=g3/32, a7=g9/64 (all exponents are taken mod 83).
If b1b2⋯b7≥128, then by the AM-GM inequality we have
b1b2⋯b7(b1+b2+⋯+b7)≥7(b1b2⋯b7)8/7≥7⋅28>1000
Therefore 675 is optimal.