39400+ entries in 0.023s
mircea_popescu: the
thing with subs is
that failure means failure,
there's no "oh, no brakes, stopped car in ditch".
mircea_popescu: i don't
think it's dead
though, answers
to eg !!key. mayhap something i'm fucking up syntax-wise.
mircea_popescu: trinque, as it happens i was gonna do a buncha small payments, but deedb ot not answering
to !!withdraw ?
mircea_popescu: but gigantgic hamster wheel in dank cellar quite
the pic.
mircea_popescu: im
totally gonna look into
this. what's
the big deal, a generator and some welding.
trinque: hey folks, just a heads-up
that castle
trinque is running on batteries atm due
to a blown
transformer. wallet will be around while batteries last, after which we'll be awaiting
the mains.
mircea_popescu: anyway, i guess what i'm
tryingto say is
that if i were looking
to dig among
the liar set i'd be mostly
trying
to guide it by
the charmicael set.
mircea_popescu: yeah ; more properly :
there is a class of numbers
that are both carmichael numbers and strong liars.
mircea_popescu: small sets of small liars are
trivially produced, eg 1 , 8 , 18 , 47 , 57 , 64 are liars for 5 * 13.
mircea_popescu: in any case,
to get back
to
the previous line : afaik all m-r liars are also carmichael numbers.
mircea_popescu: yes of numberline. definitely. but not of "x
to y" interval for close x, y.
mircea_popescu: moreover, it's likely
that a set of 100% consecutive liars of arbitrary length can be found.
mircea_popescu: asciilifeform,
the problem with
that 3/4 figure is
that it's ~an average~ (obtained by a very
trivial calculation).
there's no known way
to evaluate
the statistical divergence over a finite set.
mircea_popescu: another piece of
the puzzle is
that while small numbers are ~perfect~ witnesses for up
to a certain value,
they become
terrible witnesses
thereupon, which is why small witnesses are useless in crypto
mircea_popescu: all of
this is only interesting if enemy can set your witnesses, correct.
mircea_popescu: but even
taking a small selection among
these
to produce a sieve, and
then churning a bunch of composites
through it, might produce some lulz.
a111: Logged on 2019-03-27 23:22 mircea_popescu: asciilifeform,
there's eg ~20mn carmichael numbers under 10^20
mircea_popescu: ie, you don';t have
to
try "all", but do
try all mutual products of all known carmichael numbers.
mircea_popescu: in more practical
terms : about 1/4 of products of strong liars are also strong liars, which is another constructive direction.
mircea_popescu: dood actually lists a 400 digit number
to which ~300 items are strong liars
mircea_popescu: finding
the nontrivial square roots of 1 modulo n is a hard problem ; but constructing some is not. anyway, not right now in
the best form
to go
through archives but will see
to
this.
mircea_popescu: the principal problem with it was
that
they ended up large.
mircea_popescu: ima have
to dig
this up, pretty sure i read up on
this (very limited) mewthod of constructing m-r false witnesses for a
two-primes product.
mircea_popescu: the problem's converse : construct k integers
that are false witnesses for
the primality of
the pq product.
mircea_popescu: yes ; but by analogy i expect it's possible you have some m-r liars up
to
the large (4096 bit is a large number) numbers we're dealing wqith
mircea_popescu: asciilifeform,
there's eg ~20mn carmichael numbers under 10^20
☟︎ BingoBoingo: In still other news, US sheep herd hits an all
time low.
BingoBoingo: Seriousky, all
that's left is shit and graft fulfilled with more shit
BingoBoingo: ^ From Spreadsheets in Space
to Field Exercises in Spreadsheets!
Mocky: billymg: if your
tinymce patch is ready
this weekend I'll
test it with my setup.
☟︎