Description
Originally posted over Python discuss:
Despite its name, at the time of writing, for most of the cases (where the wheels are small) it does not make the pip install/pip download process any faster. The only case that it might be an optimization is where pip runs into a lot of dependencies conflicts and has to perform a series of backtracking.
Moreover, unlike the normal wheel download, the lazy implementation performs multiple requests. On unstable networks like mine, this makes it a lot slower than downloading the same size of data but in one single response (citation needed, I know this is generally believed but I'd love to read an article explain the reason in details). The first step to tackle this that I have in mind is to refuse to use range requests when a wheel is smaller than a certain size (a few times of chunk size perhaps?). There might need to be more experiments to further optimize this but this is the first thing I can think of. I'd really appreciate any suggestion, even just mere ideas of what to explore.
If possible, please assign this issue to me so I can better keep track of my GSoC project.