18000+ entries in 0.165s
a111: Logged on 2018-01-18 14:57 asciilifeform: 'The United States federal government has paid approximately half a million dollars to a private corporation to help various agencies conduct surveillance on the Bitcoin blockchain'
<< pretty lulzy, that's, e.g., 3 janitors, 2 clerks, 1 intern, for 1yr
a111: Logged on 2018-01-17 21:41 asciilifeform: 'Cyber space is an increasingly risky discourse and therefore will inevitably be securitised.'
<< exactly what i said: usg stuffed shirt.
a111: Logged on 2018-01-17 20:13 apeloyee: I proposed being able to name arbitrary required antecedents
<< also probably needs a mechanism to declare "there are no other files in the tree"
diana_coman:
http://btcbase.org/log/2018-01-18#1772485 <- after things are put together by human hand it takes human hand to take them apart, yes, unsurprising; point is it's enough to choose and pick out of the desired vpatch what is relevant (i.e. for keccak in this example) and that's as far as it goes
☝︎ mircea_popescu:
http://btcbase.org/log/2018-01-17#1771941 << it means the bar for what may be acceptable primitives is slightly lower than before ; this is not necessarily avoidable though, the advantage of having alphabet starts around having twenty or so letters only ; fifty letter "alphabet" is not much better than 5000 hieroglyphery.
☝︎ a111: Logged on 2018-01-17 19:43 asciilifeform: fenómenos que "no tiene antecedentes" en el país
<< orly?
deedbot: shinohai updated rating of mats from 2 to 3
<< #trilema - Never has let me go into battle with an empty war-chest.
mod6:
<+mircea_popescu> if anyone is wondering, alf lives in a sausage plant. there's lots of meat.
<< been wondering if I should move in with him, or take bets on when he gets scurvy
BingoBoingo:
<asciilifeform> or is that just hollywoods
<< The Greeks did it!
shinohai: "A promise from the SCAM coin team: We won't sleep until SCAM coin has been successfully listed on at least one shitty exchange."
<<< Truth in advertising now I guess.
a111: Logged on 2018-01-17 13:09 esthlos:
http://btcbase.org/log/2018-01-16#1771055 << My thought was to scrap the current client in favor of a customized one, with eucrypt protocol as the backbone. Is this 1. not what you want, or 2. a bad idea?
a111: 2017-09-13
<apeloyee> would O(N^2) modular multiplication be too slow?
deedbot: asciilifeform rated amberglint 1
<< bolixologist
deedbot: trinque rated amberglint 1
<< new blood
deedbot: diana_coman rated Covale` 1
<< euloran noob; found at least some of his way around
apeloyee: I proposed being able to name arbitrary required antecedents
<< also probably needs a mechanism to declare "there are no other files in the tree"
☟︎ apeloyee: "may be a 50kg sword"
<< doesn't seem to be. can be retrofitted into an existing design. as i said above "there needs to be a tree hash in the _leaf_ patch. and it MUST match the resulting tree"
apeloyee: ~will~ write to the zero cell
<< why not to minus-one cell then
apeloyee: well it'd turn a pop from empty stack into a range-dipping eggog instantly
<< the reason I even suggested that 3 weeks ago
apeloyee: "1) ugly"
<< can't see that.; "2) ... it relies on type ranges for good chunk of the proofolade"
<< if you really want, can explicitly declare a subtype of Stack_Positions, omitting 0 from it
apeloyee: can you think of a way to have the range of SP and of Stack be the same
<< this is plainly absurd. a N-sized stack has (modulo contents) N+1 possible states: "0 elements", "1 element", ..., "N elements". i.e.the ranges MUST differ, by exactly one.
apeloyee: MustNotZero has 0 to do with Stack(0)
<< I know.
a111: Logged on 2018-01-17 11:28 apeloyee:
http://btcbase.org/log/2018-01-16#1771004 << it's not me that does it at the expense of obvious correctness, but _you_. instead of having the compiler enforce no access to Stack(0), one is forced to rely solely on manual checking. But enough about that trivial matter; I'll just make the change locally.
a111: Logged on 2018-01-16 15:57 mircea_popescu:
http://btcbase.org/log/2018-01-16#1770890 << to be clear, the idea here is that you pick up the extant eulora client, gut it of the current eulora functionality, put eucrypt in there and proceed to implement your idea. this way you have a proved-to-cross-compile platform to start from.
apeloyee:
http://btcbase.org/log/2018-01-16#1771004 << it's not me that does it at the expense of obvious correctness, but _you_. instead of having the compiler enforce no access to Stack(0), one is forced to rely solely on manual checking. But enough about that trivial matter; I'll just make the change locally.
☝︎☟︎