W3C home > Mailing lists > Public > ietf-http-wg@w3.org > January to March 2016

Re: Submitted new I-D: Cache Digests for HTTP/2

From: Stefan Eissing <stefan.eissing@greenbytes.de>
Date: Wed, 13 Jan 2016 10:08:12 +0100
Cc: HTTP Working Group <ietf-http-wg@w3.org>
Message-Id: <813F66AD-421F-4B16-8B7E-41B3A9CE03C9@greenbytes.de>
To: Kazuho Oku <kazuhooku@gmail.com>

> Am 13.01.2016 um 02:47 schrieb Kazuho Oku <kazuhooku@gmail.com>:
> 
> 2016-01-12 18:46 GMT+09:00 Stefan Eissing <stefan.eissing@greenbytes.de>:
> [...]
>> 2. Would it make sense to limit N and P, so that (N*P) which is
>> used for modulo calculation stays in unsigned 32 bit? Even with
>> N==P it would work up to 65K, if I am not mistaken...
> 
> That is possible, but I am not sure if we should optimize that much.
> 
> The computational cost of restricting N*P to 32bit (as opposed to
> 64bit proposed by Martin) should be negligible; the dominant factor
> for encoding / using the digest will be calculating the SHA256 of the
> URLs.

I missed the proposal by Martin. A 64 bit limit will also work for me.

-Stefan
Received on Wednesday, 13 January 2016 09:08:40 UTC

This archive was generated by hypermail 2.3.1 : Tuesday, 22 March 2016 12:47:10 UTC