In the context of voting schemes, it will be argued that small interval proofs occur 'naturally' and also that there is a need for interval-lengths which are not an integral power of 2. Interval proofs for arbitrary lengths will be treated and solved efficiently.
The results for small interval will then be compared to techniques for large intervals, focusing on performance of the various techniques (there are also differences w.r.t. the particular intractability assumptions needed). An estimate will be given of the break-even point for these two approaches.