Index time boosts don't have much granularity, so you would run out of
values pretty quickly, unless I am misunderstanding your proposal.
From Similarity.encodeNorm:
/** Encodes a normalization factor for storage in an index.
*
* The encoding uses a three-bit mantissa, a five-bit exponent
Don't ask me why this occurred to me, since I'm working on a
completely different project... Mostly, this is intended to have
folks who really understand the scoring algorithms chime in and
tell me it's a silly idea .
We've seen multiple threads asking the question: "How can I
cause more-recent do
