asciilifeform: so this thing parallelizes 'embarrasingly'.
asciilifeform: note that this is an upper bound, it applies regardless of what kind of magic is used.
asciilifeform: is this obvious or do i need to draw picture.
asciilifeform: if we know B - k shared topmost bits, then the work required to break in comparison with work W, supposing we knew B bits, is at most W*(2^k).
asciilifeform: btw, here is a handy elementary proof of a certain thing,
asciilifeform: not necessarily top, or bottom of prime.
asciilifeform: sarkar et al promises (the recipe is quite gnarly) ANY substring