- From: Stefan Eissing <stefan.eissing@greenbytes.de>
- Date: Wed, 13 Jan 2016 10:08:12 +0100
- To: Kazuho Oku <kazuhooku@gmail.com>
- Cc: HTTP Working Group <ietf-http-wg@w3.org>
> 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