6300+ entries in 0.43s
mircea_popescu: ben_vulpes which one is a "modal" ? "carousel" is that stupid shit when pics keep scrolling like a
2.0 version of <marquee> right
deedbot: shinohai updated rating of diana_coman from 1 to
2 << Eulora trades always fair and fortunate.
ben_vulpes: the naive o(n^
2) calculation is to say "there is a signature for this patch" and not giving a shit about which signature, provided it corresponds to a key in .wot .
mircea_popescu: but yes, the statement is correct. to restate : 1. padding is defined as a function F (x, y) with x, y and F ∈ N such that
2. F is defined for all (x, y) pairs and that 3. given any set of boolean functions Ki(x) along with their values no Kj(y) can be constructed so their values are known besides K0(y) = true for K0(a) = 1 if a=y and 0 if a!=y and 4. given any set of boolean functions Ki(y) along with their values no Kj(x)
mircea_popescu: ben_vulpes lol that leclerc dude is visiting your blog on a weekly basis ?
2, 9, then nobody gave a shit so he skipped 16 and i guess 23, we see him on the 30th ?
mircea_popescu: asciilifeform let me ask you this : suppose the tape is byte-sized, and the 8 bits are as follows :
2 bits x movement ;
2 bits y movement ;
2 bits z movement ; stop and flip bits for a total of 8. the tape is now a space.
mircea_popescu: but the space gets pretty narrow. 3n, you shoot n^(1/
2) messages you're suddenly losing
mircea_popescu: if the message is n long, does the pad-machine tape need to be n^
2 ?
mircea_popescu: individually. like the list could be x^
2 = 4 ; x = 1 ; x ^ 3 + 5 = 6 - in which case your arbitrary equation may be a polynomial in x but not in x y
mircea_popescu: 1) you can have a list of equations that do have solutions ;
2) that if your list only contains X Y and Z unknowns, then the arbitrary item won't contain Q unknown
a111: Logged on 2016-12-23 14:07 mircea_popescu:
http://btcbase.org/log/2016-12-21#1587182 << speaking of this, here's a question for the eager : a diophantine equation is a multivariate polynomial, something like ax+by^
2 = 0. the question is : given an arbitrary finite set of known-good equations, can you use recursion to decide whether an arbitrary equation in the same variables is good (has integer solution) or no good ?
mircea_popescu: the reason is that same old mc^
2 ; there's no better heat dampener than water nor better energy dampener than mass.
mircea_popescu: 1. all ordered sets will create cycles whenever the index repeats ;
2. tmsr uses ordered sets to resolve specific problems of code development ; the application is called v ; 3. for the purpose tmsr uses ordered sets for, cycles are intolerable (the turing problem resolves to "acyclic set graph" in this particular case) ; 4. there is no way to guarantee numbers do not repeat.
mircea_popescu:
http://btcbase.org/log/2016-12-21#1587182 << speaking of this, here's a question for the eager : a diophantine equation is a multivariate polynomial, something like ax+by^
2 = 0. the question is : given an arbitrary finite set of known-good equations, can you use recursion to decide whether an arbitrary equation in the same variables is good (has integer solution) or no good ?
☝︎☟︎☟︎ mircea_popescu: mod6 yeah, if it's a (
2 sigs) -> b(
2 sigs) -> c(1 sig) -> d(
2 sigs again) then it's a valid press.
a111: Logged on 2012-04-13 11:00 `MBot: [ GLBSE ] [ TRADE ] [ TYGRR-BOT ] [
2 x 0.99999 = 1.999980 BTC ]
ben_vulpes: what'd the repulic accrete this year,
2 new faces?
a111: Logged on 2015-08-08 04:11 asciilifeform: mircea_popescu: in somewhat related nyooz, i've been experimenting with what for now i call 'v' - a very dumb 'versioner' that i've been writing, which eats solely 0) pgp keys 1) patches
2) signatures for same, many-to-many mapping of (
2) to (1)
mircea_popescu: incidentally, speaking of misfortunate subhumans : anyone care to guess the most frequent answer my bot gets ? it's "most frequent" in the sense that the next-frequent is like
2 std deviations rarer. hint : it's a question.
a111: Logged on 2016-12-22 07:32 jurov: also, there is limit of
2^32 inodes, even in 64-bit mode
a111: Logged on 2016-12-22 07:32 jurov: also, there is limit of
2^32 inodes, even in 64-bit mode
mircea_popescu: shinohai chick's from like 2009, what do you want. she gets
2 or 3 btc for teh dollar.
mircea_popescu: "¿Sabes algo sobre Bitcoin?" "Se que es una especie de almacenamiento de dinero virtual , que por un dólar te dan
2 o 3 bitcoins o algo así , que básicamente se usa para comprar online y conseguir descuentos creo"
jurov: also, there is limit of
2^32 inodes, even in 64-bit mode
☟︎☟︎ a111: Logged on 2016-12-22 01:40 ben_vulpes:
2) death()-ing on signatures for which a key does not exist in .wot
a111: Logged on 2016-12-22 01:40 ben_vulpes:
2) death()-ing on signatures for which a key does not exist in .wot
ben_vulpes: 1) is incorrect imho and
2) also incorrect imho
ben_vulpes:
2) death()-ing on signatures for which a key does not exist in .wot
☟︎☟︎ ben_vulpes: and yes, this implies an o(n^
2) worst case process in (or (map 'boolean (lambda (sig) (verify 'some_patch.vpatch' sig)))
mircea_popescu: for every patch, check if patch sig by approved names is present. this isn't any sort of N^
2 ; it's O(N*M) where N is the count of patches and M the count of approved signers.
a111: Logged on 2016-01-18 15:35 ascii_butugychag: jurov: theoretically you can avoid using the name prior to .sig, but then you have to check ALL seals agains ALL patches ALWAYS and this is O(N^
2)
jhvh1: Last
2 lines bashed and pending publication
mircea_popescu: nevertheless, bitcoin
2.0 has no room for this serial nonsense.
jhvh1: pete_dushenski: (0.0003*
2)/(4*4)*100 = 0.00375
pete_dushenski: compare and contrast the time inputs too : 4 years x 4 researchers = 12 page report (vs) .0003 years x
2 researchers = 12 page report.
ben_vulpes: crime
2: isn't this actually evidence that poor hispanics drug their kids more than anything else?
jhvh1: mircea_popescu: 10**12 * ln(10**12) =
2.7631021115928547E13
ben_vulpes: i acquiesed to the inanity and made
2 nodes happen
jhvh1: BingoBoingo: Current Blocks: 444081 | Current Difficulty: 3.10153855703E11 | Next Difficulty At Block: 445535 | Next Difficulty In: 1454 blocks | Next Difficulty In About: 1 week,
2 days, 22 hours, 59 minutes, and 1 second | Next Difficulty Estimate: None | Estimated Percent Change: None
mircea_popescu: anyway ; the cat situation evaluates to worse quite explainably, because if woman misbehaves and woman is beaten then 1 norm is breached ; whereas if woman misbehaves and cat is beaten then
2 norms are breached. the way reptile brain works, the sum of two variables is larger than either one no matter what happens ; and larger by a fraction of the largest of the two, not by the smaller of the two.
mircea_popescu: atm it's not fucking usable, it's been trying to load for
2 minutes.
mircea_popescu: isuse but not beyond. he's a very poor source to learn new words through practice from for this reason. in any case, some strong statements on the topic'd be that a.1) it's originally a vor ie russian prison system concept ; a.
2) there's nothing ever fun about it, nor mirthful ; a.3) roosters and feathers are deeply involved for some reason. b) "only whoever said nothing today said this." is self-contradictory on the face - d
ben_vulpes: and maybe
2 boards out of the whole 150' house length per row are matched at the ends
mircea_popescu: 1. user says !%cred ;
2. mimisbrunnr replies with link to rsa-encrypted user/pass/url combination for, eg, a ftp session ; 3. if i share the url, i share the url, with whoever i want ; 4. you meter and bill ; 5. !%destroy kills it
deedbot: BingoBoingo rated phf
2 << Kiln dried, solid work wrapping Republican proceedings with webs
mircea_popescu: if i were to endeavour to prove all primenumbers larger than
2 are odd, you'd count yourself satisfied if i showed a number that's prime and larger than
2 can not exist, yes ?
phf: dropbox is finally discontinuing public folder. "we’ve built even better ways for you to share securely and work together with your team." what a load of shit. literally the best feature they had was unmediated ~/pub/. the "better ways" they are referring to is a web
2.0 style "USE DROPBOX CLIENT (or click here to download directly like some kind of loser)"
a111: Logged on 2016-12-16 06:24 trinque: in other python
2 was already shit... all([]) -> True yet any([]) -> False
Framedragger: "In the first year of the Nissan Revival Plan, Nissan's consolidated net profit after tax climbed to $
2.7 billion for fiscal year 2000, from a consolidated net loss of $6.46 billion in the previous year. Twelve months into his three-year turnaround plan, Nissan had returned to profitability, and within three years it was one of the industry's most profitable auto makers, with
mircea_popescu: irl, there's ssh
2.0 and ssh
2. 0 ; and ~one implementation, by a known-bad team.