| 00:02 |
BingoBoingo |
ty trinque |
| |
~ 33 minutes ~ |
| 00:35 |
phf |
asciilifeform: https://zeptobars.com/en/read/baikal-t1-mips-Imagination-Technologies-P5600-Warrior |
| |
~ 50 minutes ~ |
| 01:25 |
ben_vulpes |
http://btcbase.org/log/2017-03-01#1620306 << to round the thread out, i also enjoy veen's company tremendously |
| 01:25 |
a111 |
Logged on 2017-03-01 00:10 ben_vulpes: not the pipes necessarily, but the garden; dog; wife; child; engines of my own... |
| 01:26 |
ben_vulpes |
whoa pretty phf |
| 01:28 |
ben_vulpes |
> we love microchips - that's why we boil them in acid |
| |
~ 1 hours 23 minutes ~ |
| 02:51 |
ben_vulpes |
http://trilema.com/2017/towards-a-better-hash-function/#comment-121460 << bug in screw examples? |
| |
~ 2 hours 9 minutes ~ |
| 05:01 |
mircea_popescu |
ima look into it. |
| |
~ 48 minutes ~ |
| 05:50 |
deedbot |
http://trilema.com/2017/the-redditard/ << Trilema - The Redditard |
| |
~ 2 hours 6 minutes ~ |
| 07:57 |
shinohai |
http://archive.is/Twxkq <<< CoinDesk gets new CEO, still no plans to publish newsworthy articles however. |
| 08:09 |
deedbot |
http://phuctor.nosuchlabs.com/gpgkey/2C3FC522334163C0B6CF55BAF32AF6EB7DB80ECA003153CA2D167C84C9B4DC42 << Recent Phuctorings. - Phuctored: 1137...2399 divides RSA Moduli belonging to '223.94.90.83 (ssh-rsa key from 223.94.90.83 (13-14 June 2016 extraction) for Phuctor import. Ask asciilifeform or framedragger on Freenode, or email fd at mkj dot lt) <ssh...lt>; ' (Unknown CN) |
| 08:09 |
deedbot |
http://phuctor.nosuchlabs.com/gpgkey/B079AB36D0E866779596469C3FAEBEF7B8C64D767B5C70392CA63F69F82FA1EC << Recent Phuctorings. - Phuctored: 1090...3007 divides RSA Moduli belonging to '183.245.198.38 (ssh-rsa key from 183.245.198.38 (13-14 June 2016 extraction) for Phuctor import. Ask asciilifeform or framedragger on Freenode, or email fd at mkj dot lt) <ssh...lt>; ' (Unknown CN) |
| 08:09 |
deedbot |
http://phuctor.nosuchlabs.com/gpgkey/2C3FC522334163C0B6CF55BAF32AF6EB7DB80ECA003153CA2D167C84C9B4DC42 << Recent Phuctorings. - Phuctored: 1090...3007 divides RSA Moduli belonging to '223.94.90.83 (ssh-rsa key from 223.94.90.83 (13-14 June 2016 extraction) for Phuctor import. Ask asciilifeform or framedragger on Freenode, or email fd at mkj dot lt) <ssh...lt>; ' (Unknown CN) |
| 08:09 |
deedbot |
http://phuctor.nosuchlabs.com/gpgkey/B079AB36D0E866779596469C3FAEBEF7B8C64D767B5C70392CA63F69F82FA1EC << Recent Phuctorings. - Phuctored: 1177...2589 divides RSA Moduli belonging to '183.245.198.38 (ssh-rsa key from 183.245.198.38 (13-14 June 2016 extraction) for Phuctor import. Ask asciilifeform or framedragger on Freenode, or email fd at mkj dot lt) <ssh...lt>; ' (Unknown CN) |
| |
~ 1 hours 7 minutes ~ |
| 09:17 |
mircea_popescu |
where did they get this "ceo" from, was he the previous VP of ceosunlimitedbocavistatexas.tripod.com ? |
| 09:18 |
* |
mircea_popescu likes reading the foundation reports. |
| 09:21 |
shinohai |
Previous ceo wasn't bringing in enough shillbux. |
| 09:21 |
mircea_popescu |
wow check it out, a quarter of the baikal chip's unused. |
| 09:24 |
mircea_popescu |
this looks entirely very promising. where's my winnings alf ? |
| 09:29 |
asciilifeform |
actually this is a mega-snoar, looks like the makers used 100% western toolchain, even macrocells |
| |
↖ |
| 09:29 |
asciilifeform |
even so i'd buy one |
| 09:30 |
asciilifeform |
(but fat chance of finding!) |
| 09:31 |
asciilifeform |
oh hey lol they licensed the core! |
| 09:31 |
mircea_popescu |
there's nothing "Western" about pn np pn stranding. |
| 09:32 |
mircea_popescu |
but in other western technologies, http://68.media.tumblr.com/d10a3976994cae7727aeb3127572ad86/tumblr_mmbrdcBrgU1rgefeko1_1280.jpg |
| 09:33 |
asciilifeform |
woah |
| 09:33 |
asciilifeform |
circus-grade |
| 09:35 |
mircea_popescu |
no this is how it goes. |
| 09:36 |
asciilifeform |
in yet-other western tech, https://archive.is/YcSdC << 'A mid-2016 security incident led to Apple purging its data centers of servers built by Supermicro, including returning recently purchased systems... ... A source familiar with the case at Apple told Ars that the compromised firmware affected servers in Apple's design lab, and not active Siri servers. The firmware, according to the source, was downloaded directly from Supermicro's |
| 09:36 |
asciilifeform |
' |
| 09:37 |
mircea_popescu |
aww |
| 09:37 |
asciilifeform |
...Supermicro's support site—and that firmware is still hosted there.' |
| 09:44 |
asciilifeform |
re upstack -- i actually have here an earlier mips from imagination co. -- it is notbad.jpg (tested back in the day as potential pogo replacement) |
| 09:48 |
asciilifeform |
from shinohai's link , 'Microsoft, Intel, banks form Enterprise Ethereum blockchain alliance' |
| 09:48 |
asciilifeform |
didjaknow. |
| 09:49 |
mircea_popescu |
eh fiss. |
| 09:50 |
shinohai |
What could possibly go wrong? |
| 09:50 |
mircea_popescu |
they've been doing this whole "add logos to a printed page" thing for years now, it did 0. |
| |
~ 24 minutes ~ |
| 10:14 |
asciilifeform |
https://zeptobars.com/en/read/Espressif-ESP8266-wifi-serial-rs232-ESP8089-IoT << oh hey |
| 10:14 |
asciilifeform |
this d00d never rests |
| 10:15 |
asciilifeform |
1000s of die pr0nz |
| 10:20 |
asciilifeform |
https://zeptobars.com/en/read/bitfury-bitcoin-mining-chip << such as |
| 10:21 |
mircea_popescu |
he's pretty cool isn't he. |
| 10:21 |
mircea_popescu |
someone invite him over! |
| 10:23 |
asciilifeform |
so far mircea_popescu is the people-bringin' champ |
| 10:24 |
asciilifeform |
( asciilifeform batting 0 / N to date ) |
| 10:24 |
mircea_popescu |
i don't have an email! |
| 10:24 |
asciilifeform |
maybe hanbot ? |
| |
~ 58 minutes ~ |
| 11:22 |
deedbot |
http://phuctor.nosuchlabs.com/gpgkey/FE6946A3BC2C63FF4316CD566875F2A65BCBFCF5FF6BB420A3F08B6FBA5EE0A0 << Recent Phuctorings. - Phuctored: 1351...3347 divides RSA Moduli belonging to '81.94.239.189 (ssh-rsa key from 81.94.239.189 (13-14 June 2016 extraction) for Phuctor import. Ask asciilifeform or framedragger on Freenode, or email fd at mkj dot lt) <ssh...lt>; ' (mail.mnl-latvia.lv. LV 099) |
| 11:22 |
deedbot |
http://phuctor.nosuchlabs.com/gpgkey/FE6946A3BC2C63FF4316CD566875F2A65BCBFCF5FF6BB420A3F08B6FBA5EE0A0 << Recent Phuctorings. - Phuctored: 1614...4133 divides RSA Moduli belonging to '81.94.239.189 (ssh-rsa key from 81.94.239.189 (13-14 June 2016 extraction) for Phuctor import. Ask asciilifeform or framedragger on Freenode, or email fd at mkj dot lt) <ssh...lt>; ' (mail.mnl-latvia.lv. LV 099) |
| 11:28 |
asciilifeform |
https://archive.is/gRPSR << meanwhile, in prng lulz ! |
| 11:36 |
asciilifeform |
mircea_popescu, mod6 , et al : meanwhile, http://nosuchlabs.com/pub/with_cache_yet_moar.txt |
| 11:37 |
mircea_popescu |
sorry alf i'm busy chatting up this engineering 19yo. |
| 11:38 |
asciilifeform |
lolk |
| 11:39 |
asciilifeform |
(subj can wait for eons, really, it's a running log of crapolade timer) |
| 11:39 |
mircea_popescu |
well thanks for the highlight then :D\ |
| 11:52 |
mircea_popescu |
!!rate omraphantom 1 kinkster engineer teenager or something. |
| 11:52 |
deedbot |
Get your OTP: http://p.bvulpes.com/pastes/Po5lA/?raw=true |
| 11:52 |
mircea_popescu |
!!v 83F8592A75BE0CEAA1DDE5BDE9B3DB2F8C280413A0E2F5DC82A45684A4D0DF34 |
| 11:52 |
deedbot |
mircea_popescu rated omraphantom 1 << kinkster engineer teenager or something. |
| 11:52 |
mircea_popescu |
hey BingoBoingo were you in georgia ? |
| 11:53 |
asciilifeform |
iirc BingoBoingo is normally found in missouri |
| 11:54 |
mircea_popescu |
o was he ? |
| 11:54 |
asciilifeform |
aha, unless recently moved |
| 11:56 |
omraphantom |
hey |
| 11:58 |
asciilifeform |
hello omraphantom |
| 11:58 |
asciilifeform |
mircea_popescu: friend of yours from meatspace ? |
| 11:59 |
mircea_popescu |
nope. |
| 12:00 |
mircea_popescu |
showed up asking questions. |
| 12:03 |
* |
pete_dushenski just invited zeptobars over :) |
| 12:04 |
mircea_popescu |
whoss ah the chip pornographer ? nice. |
| 12:04 |
pete_dushenski |
lol yup |
| 12:05 |
pete_dushenski |
probably a slightly older kinkster engineer than omraphantom |
| 12:05 |
omraphantom |
lol |
| 12:05 |
omraphantom |
i'm not reallly an engineer yet lol |
| 12:06 |
pete_dushenski |
what's the attrition rate at your school ? |
| 12:07 |
omraphantom |
starting in spring spent to long on that souls searching wtf will do phase lol |
| 12:09 |
omraphantom |
i'm going to be 20 when i start now flm |
| 12:09 |
omraphantom |
no what not spring |
| 12:09 |
omraphantom |
fall |
| 12:09 |
omraphantom |
when i can't think straight to gewt the seasons right >.< |
| 12:10 |
* |
shinohai waves to pete_dushenski |
| 12:10 |
pete_dushenski |
omraphantom: aha just getting rolling then. eh no rush to start eng school. a chunk of the guys here started but didn't even finish |
| 12:10 |
* |
pete_dushenski salutes back to shinohai! |
| 12:10 |
omraphantom |
i might start and end up pursuing a different degree |
| 12:11 |
omraphantom |
but for now i need to focus on the general education credits |
| 12:12 |
pete_dushenski |
you'd do worse than adding some #trilema logs to that general diet |
| 12:13 |
omraphantom |
well 4 year degree general credits are needed |
| 12:14 |
omraphantom |
but at the same time i'm not saying i won't be doing my course credits |
| 12:20 |
pete_dushenski |
sure. and where'd you hear about this channel ? we need some more market research metrics |
| 12:21 |
thestringpuller |
w/ind 20 |
| 12:21 |
thestringpuller |
>:( |
| 12:22 |
omraphantom |
i heard of it from mircea |
| 12:24 |
pete_dushenski |
o cool |
| 12:24 |
omraphantom |
they have a carpenter friend that was in my state i should meet apparently. i have a furniture blueprint just zero skills lol |
| 12:27 |
pete_dushenski |
speaking of wences, he was still pretending to be a person as recently as july 2015 (http://www.contravex.com/2015/07/21/wences-whacked-xapo-zapped/) though can't say i've heard a meaningful peep from him or about him since aside from 'swiss kyc blahblah' nothing-on-a-stick. |
| 12:28 |
omraphantom |
me bored with too much time = crazy idea written out with no way to make it real |
| 12:28 |
pete_dushenski |
omraphantom: i'm sure BingoBoingo can mentor you on carpentry but he's a couple states away in mo. |
| 12:29 |
pete_dushenski |
online learning though! it's the future. |
| 12:29 |
omraphantom |
yeah |
| 12:31 |
omraphantom |
i've looked into crypto recently i've been poking at this key stuff last couple days been learning a lot |
| 12:32 |
pete_dushenski |
speaking of learning, "Core exists as dictatorship and tyranny, upholding speech control, colluding to attack people with different views, has become the biggest threat of the long-term development of Bitcoin". ~bitmain miner guy (http://imgur.com/a/mhEEd) |
| 12:37 |
danielpbarron |
!!v 4BD380C65B267722D29CD0A765BAD340DEBF6ACDCE2B8F1337BA7FB9F6142FCF |
| 12:37 |
deedbot |
danielpbarron rated omraphantom 1 << euloran bundle maker |
| 12:39 |
danielpbarron |
!!v DAA04E744674D33C096C3D91D86C12CDCD4CA9DF3A57AEFCC966CE993734ADC4 |
| 12:39 |
deedbot |
danielpbarron rated Aphex_ 1 << euloran bundle maker |
| 12:41 |
ben_vulpes |
mircea_popescu: tried again, with possibly adequate specificity this time! |
| 12:42 |
danielpbarron |
re: ratings above, both were very enthusiastic in performing some tasks for me in Eulora. very helpful, would hire again |
| |
~ 20 minutes ~ |
| 13:03 |
shinohai |
https://twitter.com/gnupg/status/836996411061387266 <<< in gnupg lulz |
| 13:06 |
asciilifeform |
'@aeliasen @gnupg for fingerprints collisions are not interesting. There is no known preimage attack for SHA1. Keep calm and use OpenPGP.' << lel |
| |
~ 47 minutes ~ |
| 13:54 |
mircea_popescu |
omraphantom yeah, turns out he's from missouri though ;/ |
| 13:54 |
mircea_popescu |
ben_vulpes lessee! |
| 13:56 |
mircea_popescu |
right you are, i updarted it. |
| 13:58 |
* |
asciilifeform has been thinking very seriously about how to make http://trilema.com/2016/the-necessary-prerequisite-for-any-change-to-the-bitcoin-protocol correctly; and is quite bugged by the fact that ~verification~ is O(N) |
| 13:58 |
asciilifeform |
eventually (given death of moore's law, already long ago) the minimal practical time will exceed the block interval, and then mega-headache. |
| 13:59 |
asciilifeform |
in fact verification from-genesis is O(N^2) ! |
| 13:59 |
mircea_popescu |
there is that. |
| 13:59 |
asciilifeform |
actually worse than N^2 |
| 13:59 |
mircea_popescu |
however, if you already did the work, what is the problem ? |
| 14:00 |
asciilifeform |
if you already live on mars, there is no problem in flying to mars, yes. |
| 14:00 |
mircea_popescu |
but this is what the nodes ~are selling~. the o(n^e ness) |
| 14:00 |
asciilifeform |
but if standing up a brand-new node from scratch, with full verification (rather than dumb bitwise copy of existing node) takes a century... |
| 14:01 |
mircea_popescu |
so ? |
| 14:01 |
mircea_popescu |
cdb. |
| 14:01 |
asciilifeform |
what's that |
| 14:01 |
mircea_popescu |
cost of doing business. |
| 14:01 |
mircea_popescu |
"mining a block takes a century" currently, it's no bug. |
| 14:02 |
asciilifeform |
an inevitable visaification, The Guild of The Three Nodes, etc, at t-->inf, is a downer. |
| 14:02 |
asciilifeform |
mining != verification. |
| 14:02 |
mircea_popescu |
understand, there's no way to at the same time give nodes marketable data AND make it so any redditard can just pop a node |
| 14:02 |
mircea_popescu |
these are strictly contradictory constraints. |
| 14:02 |
asciilifeform |
i posted one just the other day (granted it wasn't 'any redditard', but wotronic) |
| 14:02 |
mircea_popescu |
if it's valuable then not everyone can do it and vice-versa. |
| 14:03 |
asciilifeform |
anyone can bang on a keyboard, some folx still get paid for it, others -- not. |
| 14:03 |
asciilifeform |
circus bear -- can bang. |
| 14:03 |
mircea_popescu |
this is an entirely ridiculous misrepresentation of the issue |
| 14:03 |
mircea_popescu |
anyone can run current through wires. nmot what we're discussing. |
| 14:04 |
mircea_popescu |
turn on your livingroom lights, pretend you're "running a node". exactly the same as "bang on keyboard, pretend you're writing" |
| 14:04 |
asciilifeform |
as i currently understand it, mircea_popescu's algo had two major effects -- a) nodes have something valuable to sell b) all users are protocolically forced to retain all blocks |
| 14:04 |
mircea_popescu |
no, but all nodes are. |
| 14:04 |
mircea_popescu |
users are forced to nothing. |
| 14:05 |
asciilifeform |
users who want to verify blocks |
| 14:05 |
asciilifeform |
that is to say, all sane people |
| 14:05 |
mircea_popescu |
this is nodes. |
| 14:05 |
asciilifeform |
gotta store. |
| 14:05 |
asciilifeform |
what is 'user' distinct from 'node operator' ? |
| 14:05 |
asciilifeform |
a goxhead ? |
| 14:05 |
mircea_popescu |
"users who verify blocks" = nodes ; " monkeys who shave and drive cars " = people |
| 14:05 |
mircea_popescu |
user in general is "tx author". |
| 14:06 |
asciilifeform |
tx author who has no node of his own == shaved monkey |
| 14:06 |
mircea_popescu |
besides the point. |
| 14:07 |
asciilifeform |
O(N^2) verification of each incoming block, is even worse of a 'heat death' rate than of traditional bitcoin |
| 14:07 |
asciilifeform |
(which is closer to O(NlogN) |
| 14:07 |
asciilifeform |
) |
| 14:07 |
mircea_popescu |
he who knows a secret key is a bitcoin user ; he who can say if ia signed transaction is valid or invalid is a bitcoin node ; he who can include a bitcoin transaction in a block is a bitcoin miner. |
| 14:08 |
mircea_popescu |
asciilifeform there is that. |
| 14:08 |
asciilifeform |
convergence to handful of massive google-like datacenters for ~nodes~ -- not miners, but also nodes -- is inherently usgistic imho. |
| 14:09 |
asciilifeform |
this is an open problem, because 'miners don't need the blocks' is also imho intolerable. |
| 14:09 |
mircea_popescu |
im not saying it's closed by any means. |
| 14:09 |
asciilifeform |
it needs a fundamental breakthrough, i suspect. |
| 14:10 |
mircea_popescu |
yeah well... |
| 14:10 |
asciilifeform |
didn't mircea_popescu find a new chocolate icecream shop! he oughta go there, eat some, come back with theorem. |
| 14:10 |
mircea_popescu |
im gonna be off in a minute, fucking a new slut. |
| 14:10 |
asciilifeform |
maybe as good! |
| 14:11 |
mircea_popescu |
not usually. |
| 14:11 |
asciilifeform |
but before he does: |
| 14:11 |
mircea_popescu |
half the reason i'm a shitty scientist : unlike the good ones, i get laid. |
| 14:11 |
asciilifeform |
say the miner has to find a string in an old block , as part of mining, that fits a nonce-derived pattern. |
| 14:12 |
asciilifeform |
for sake of argument, an F, such that a substring S of old block B makes F(nonce + B) = true. |
| 14:12 |
asciilifeform |
this is verifiable in O(1) |
| 14:13 |
asciilifeform |
but requires access to all old blocks, to search for. |
| 14:13 |
mircea_popescu |
why ? statistically, only to a fraction. |
| 14:14 |
mircea_popescu |
you gave away your wife. |
| 14:14 |
asciilifeform |
depending on how you make F, he does need to examine all blocks. |
| 14:14 |
mircea_popescu |
this can not be guaranteed. |
| 14:14 |
asciilifeform |
(and even then may turn up short, and have to go back for a new nonce) |
| 14:14 |
mircea_popescu |
yes, but moreover he'll just keep a few blocks and go for new nonces more often |
| 14:14 |
asciilifeform |
it can be made as painful as the hashing is to begin with |
| 14:14 |
asciilifeform |
in the same way. |
| 14:15 |
mircea_popescu |
in which case it is also no longer distinct. |
| 14:15 |
asciilifeform |
how's that |
| 14:15 |
mircea_popescu |
cuz it'll be == the hashing if it's as hard as the hashing. |
| 14:15 |
mircea_popescu |
you can't turn out your wife without being married to a whore, alfie. |
| 14:15 |
mircea_popescu |
either you cheat or you don't. |
| 14:16 |
asciilifeform |
the cheat -- works. say your hash is a keccak that eats 512b blocks and produces 512b block. |
| 14:17 |
mircea_popescu |
aok |
| 14:17 |
mircea_popescu |
ok* |
| 14:18 |
asciilifeform |
the nonce is Q. miner has to now find an old block that , treated with the above walk, contains F(Q). and point to the block # and the requisite offset . |
| 14:18 |
mircea_popescu |
cheaper to spin the nonces. |
| 14:18 |
asciilifeform |
open problem. betcha one can find the pill for this., |
| 14:18 |
asciilifeform |
. |
| 14:19 |
mircea_popescu |
i dunno. the further you go prng-away from the "quote the nth line in the log", the closer you getr to "my solution to mining is mining+mining" |
| 14:19 |
asciilifeform |
(for instance, can demand that the miner find a Q that depends only on the parts of the block he cannot easily spin.) |
| 14:19 |
asciilifeform |
O(N^2) verification suxxx. |
| 14:19 |
mircea_popescu |
i have no argument with that. |
| 14:19 |
asciilifeform |
gotta find a finesse around it. |
| 14:20 |
asciilifeform |
or you get an algae globe |
| 14:20 |
mircea_popescu |
but just because we're all going to die it does not follow we should go around on stilts and weird beak masks either |
| 14:20 |
asciilifeform |
or whatever that toy is called |
| 14:20 |
asciilifeform |
the one that blooms for a bit, and dies. |
| 14:20 |
* |
asciilifeform adjusts beak mask. |
| 14:20 |
mircea_popescu |
if you ever get kicked out of engineering tower should prolly try out the arts, become draughtsman |
| 14:21 |
* |
asciilifeform goes into the pit, bbl. |
| 14:32 |
asciilifeform |
ooook try this on for size : suppose fixed-width TX (as discussed earlier.) T(N) is the Nth tx, T(0) is the first tx in genesis block, etc. Tmax is the last tx in the currentheightblock. |
| |
↖ |
| 14:32 |
asciilifeform |
T(N) is an O(1) fetch, as spoken of earlier. |
| 14:33 |
asciilifeform |
say every new block , to be valid, must contain a tx-sized slot (not covered by the nonce hash, but see below) that is computed as follows: |
| 14:33 |
asciilifeform |
T( nonce mod Tmax ) xor T ( H(nonce) mod Tmax ) xor T ( H(H(nonce)) mod Tmax ). |
| 14:34 |
asciilifeform |
there is no way to practically compute this value without having a copy of the blockchain. and it also ends up being luby-transformable into any one of the 3 old tx if you have the other 2. a kind of perpetual redundancy in the storage . |
| |
↖ |
| 14:36 |
asciilifeform |
this also entirely annihilates the possibility that a future enemy could monkey with contents of old blocks by finding hash collisions. |
| 14:38 |
asciilifeform |
theoretically it also means that a tx, as time goes to infinity, will have infinite number of confirmations... |
| 14:38 |
asciilifeform |
(statistically speaking, any sequence of blocks, will eventually end up luby-coded into future blocks ! ) |
| 14:41 |
asciilifeform |
in above example, the 'arity' of the xor is 3. and mircea_popescu will probably answer, when he comes back , that evil miner will waltz the nonce until the 3 necessary tx are the ones that fit in his pocket. but arity doesn't have to be 3. |
| 14:41 |
deedbot |
http://trilema.com/2017/the-story-of-the-scared-slut/ << Trilema - The Story of the scared slut. |
| |
↖ |
| 14:41 |
asciilifeform |
what remains is to compute the minimal arity for the attack to be impractical. and prove said fact. |
| 14:43 |
asciilifeform |
(either this, or simply replace 'nonce' in the equation, with a Z, that is equal to a hash over the ~transactions in the candidate block~, considerably more painful to waltz than the nonce ) |
| 14:44 |
asciilifeform |
now challenge for the reader ! |
| 14:45 |
asciilifeform |
suppose that tx's (recall, fixed width) position in the block, is also kept inside it. (e.g., tx # 100 will start with a 16bit field containing 0x0064 .) |
| 14:45 |
asciilifeform |
and we have the luby transform above. |
| 14:46 |
asciilifeform |
what is the complexity of actually fetching the Nth tx , if you can also make use of the T(...)xorT(...)xorT(...) in every block. |
| 14:51 |
asciilifeform |
.... another pill against 'waltzers' : Z depends on the ~previous~ block. |
| |
↖ |
| 14:52 |
asciilifeform |
( Z from here-on in this gedankenexperiment is simply a value that determines which 3 -- if arity==3 -- old tx's get xor'd ) |
| 14:53 |
* |
asciilifeform bbl. |
| |
~ 18 minutes ~ |
| 15:12 |
asciilifeform |
as far as i can see, this solves. Z depends on previous block, and the xor'd output is ~covered~ by the hash (and nonce) of the currently-worked-on block. so miner cannot craft his Z, he is forced to suck it up. |
| 15:13 |
asciilifeform |
(and he cannot even begin to work on a block until he knows Z and goes, fetches the required old tx ! no other miner has any incentive to help him do this.) |
| 15:13 |
asciilifeform |
quite the opposite. |
| |
~ 31 minutes ~ |
| 15:45 |
mircea_popescu |
asciilifeform you know that's not a half bad idea |
| 15:55 |
mircea_popescu |
lubby coding. better than simple hashing for this purpose. deifnitely. |
| 16:01 |
asciilifeform |
mircea_popescu: fixed-width tx buys us this algo. but not only it. for instance, an adult tx's unique index can be quite short : blknum_txoffset. this in turn saves space elsewhere, for all time. |
| 16:04 |
asciilifeform |
for folx tuned in : it also makes the cask thing possible, but the latter is wholly separate, optional algo, it is possible to use traditional mempools with this scheme |
| 16:06 |
mircea_popescu |
yeah. fixed width tx has some serious advantages. |
| 16:11 |
mircea_popescu |
"all txn are 2 in 2 out" fixed width txn seems nailed down at this point. i can't see how an argument would work that'd offset the evident gains. |
| 16:21 |
mircea_popescu |
i would still love to see, for what it's work, PROPER ring signatures. |
| 16:29 |
asciilifeform |
mircea_popescu: it doesn't have to be capped at 2, either, unless you use casks and want to leave room for dozen+ hop stages |
| 16:29 |
asciilifeform |
(or unless you want to make blocks ~very~ compact) |
| 16:30 |
mircea_popescu |
it's capped at 2 because 0 1 infinity. why 3 ? |
| 16:30 |
asciilifeform |
tru!! |
| 16:30 |
asciilifeform |
mircea_popescu: describe, for my education, how Proper ring signature differs from shamir's |
| 16:30 |
mircea_popescu |
first nondegenerate case. |
| 16:31 |
mircea_popescu |
asciilifeform this is an "idea" item not a technological object, so bear with me. a "ring signature" is a set of signatures with a) arbitrary cardinality n which has the property that b) while it can be verified the correct signature was offered it c) can't be established wich signature that is. |
| 16:32 |
asciilifeform |
reviewing definition of ring sig : some process , whereby a signature S can be verified against keys K1, K2, ... KN , but without revealing which K had produced it |
| 16:32 |
asciilifeform |
aha, looks like we're on same page |
| 16:32 |
mircea_popescu |
yeah. |
| 16:32 |
mircea_popescu |
once stated the pipedream portion is pretty painfully obvious ; but nevertheless, maybe ? |
| 16:33 |
asciilifeform |
let's try to at least put it on paper, what would be this squared circle |
| 16:33 |
BingoBoingo |
<mircea_popescu> hey BingoBoingo were you in georgia ? << That's thestringpuller |
| 16:33 |
BingoBoingo |
<asciilifeform> iirc BingoBoingo is normally found in missouri << Southern Illinois |
| 16:33 |
asciilifeform |
as i understand, what mircea_popescu would like is : V(K1, S)=false, V(K2, S)=false, .... BUT V(K1,K2,..,KN, S) = true |
| 16:33 |
asciilifeform |
^ ? |
| 16:34 |
mircea_popescu |
pretty much. |
| 16:34 |
asciilifeform |
how, hypothetically, would S be produced |
| 16:34 |
asciilifeform |
by owner of a particular K strictly ? |
| 16:34 |
mircea_popescu |
it's worse than that, by any owner of any k in the list. |
| 16:34 |
mircea_popescu |
otherwise you leak bits. |
| 16:34 |
asciilifeform |
'all for one an' one for all' |
| 16:35 |
mircea_popescu |
to be more rigurous : |
| 16:35 |
asciilifeform |
now let's say we have this primitive. how do you make, out of it, a bitcoinlike |
| 16:35 |
mircea_popescu |
V(K1, S1)=false, V(K2, S1)=false, .... BUT V(K1,K2,..,KN, S1) = true if and only if K1 signed S1 ; similarily with k2 and s2 all the way to n |
| 16:35 |
mircea_popescu |
it's not enough with a plain S. |
| 16:35 |
BingoBoingo |
<omraphantom> me bored with too much time = crazy idea written out with no way to make it real << Go to lumber yard, buy wood. Go to hardware store buy tools. Make things until you start making things of complexity necessary to carry skills into building crazy things |
| 16:36 |
mircea_popescu |
19yo female, bb. that's not occuring. |
| 16:37 |
asciilifeform |
mircea_popescu: even supposing that you had this, if you actually needed all pubkeys in use to-date to verify a sig... it'll be painful |
| 16:38 |
mircea_popescu |
hm |
| 16:38 |
mircea_popescu |
N would be small though. 2-12 ish sort of item |
| 16:38 |
asciilifeform |
ah |
| 16:38 |
mircea_popescu |
in FACT, the MORE sigs it uses in a ring, the more expensive the tx fee should be. |
| 16:39 |
asciilifeform |
well yes, it'll eat linearly moar cycles, to verify |
| 16:40 |
mircea_popescu |
asciilifeform re-reading i am pretty much convinced that the requirement that a) signatures are produced pairwise nevertheless b) no pairwise verification function exists yet c) verification works on a group of them is batshit insanity. might as well ask for a 5 smaller than 4. |
| 16:41 |
asciilifeform |
not necessarily |
| 16:41 |
mircea_popescu |
tsk. not algebraically either. how the fuck would V(all) work so it's not decomposed into Vi(each) |
| 16:42 |
asciilifeform |
it'd work, naturally, if the algo actually ~needed~ all of the pubkeys |
| 16:42 |
mircea_popescu |
(note that the decomposition needn't be Vs but will likely be a homomorphism, which POSSIBLY tyakes us straight to the hardest code known to man, the see-or-pick homomorphisms) |
| 16:42 |
asciilifeform |
because the signing process likewise took in all of'em |
| 16:42 |
asciilifeform |
reminds me of how one breaks shamir's ring |
| 16:42 |
mircea_popescu |
i forget wtf that is called, we discussed it. |
| 16:44 |
asciilifeform |
*remind me of how |
| 16:44 |
asciilifeform |
plz |
| 16:45 |
mircea_popescu |
asciilifeform there's this scheme whereby i create a graph, A and a homomorphism of it A'. you get ot see A', and may challenge me |
| 16:45 |
mircea_popescu |
either i must show you A, or else an A - A' relation. |
| 16:50 |
asciilifeform |
graph isomerism zkp ? |
| 16:52 |
asciilifeform |
( as in, say, these : http://web.mit.edu/~ezyang/Public/graph/svg.html ) |
| 16:52 |
mircea_popescu |
well, deciding whether two given graphs are homomorphic is > np. |
| 16:53 |
mircea_popescu |
and there was a scheme proposed whereby you either show the graphs or the relation ; op keeps challenging you ; each correct response increases the probabiling of truth by a factor of 2 |
| 16:53 |
mircea_popescu |
i derrided it for being impractical but i can't fucking find the discussion |
| 16:53 |
mircea_popescu |
was last year iirc |
| 16:55 |
mircea_popescu |
oh oh oh! it was hamiltonians! |
| 16:55 |
mircea_popescu |
!# "hamiltonian" |
| 16:56 |
asciilifeform |
can't seem to find ~this~, either |
| 16:56 |
mircea_popescu |
what the fuck i hallucinated math discussions. |
| 16:56 |
asciilifeform |
nono we had this |
| 16:56 |
mircea_popescu |
anyway. the encryption scheme is like this : you generate a large graph with a hamiltonian cycle ; and a homomorphic graph. |
| 16:57 |
mircea_popescu |
you may be challenged to either show the hamiltonian in the homomorphic graph, or else to show the homomorphism between the graphs. |
| 16:59 |
mircea_popescu |
wtf |
| 16:59 |
asciilifeform |
i actually worked with this notion last year, when investigating nonretarded (i.e. of provable complexity) block ciphering. and came to same realization that mircea_popescu is probably about to come to |
| 17:00 |
mircea_popescu |
yeah, it was part of that discussion. |
| 17:00 |
mircea_popescu |
pretty fucking frustrating. |
| 17:00 |
asciilifeform |
( spoiler : can't prove the hardness of magicking ~your particular~ graph. ) |
| 17:00 |
mircea_popescu |
that's separate. |
| 17:01 |
mircea_popescu |
heck, same stands for rsa. |
| 17:01 |
asciilifeform |
rsa doesn't pretend to a known complexity class tho. |
| 17:02 |
asciilifeform |
graph-circuit appeals because it -- does |
| 17:02 |
mircea_popescu |
yawell. |
| 17:02 |
mircea_popescu |
where the fuck is that convo |
| 17:02 |
asciilifeform |
http://btcbase.org/log/2016-06-06#1477755 << it ? |
| 17:02 |
a111 |
Logged on 2016-06-06 21:38 asciilifeform: particular case can be as simple as you like. |
| 17:03 |
mircea_popescu |
not evidently ;/ |
| 17:04 |
mircea_popescu |
http://btcbase.org/log/2016-02-10#1402378 << i think it was thereabouts. |
| 17:04 |
a111 |
Logged on 2016-02-10 20:10 mircea_popescu: basically showing that a+b < c is true or false for a, b, c in R is a harder-than-NP problem. |
| 17:04 |
mircea_popescu |
because we were doing a review of possibly weaponizable known problems |
| 17:04 |
asciilifeform |
http://btcbase.org/log/2016-03-20#1436710 << another thread re subj |
| 17:04 |
a111 |
Logged on 2016-03-20 17:10 mats: https://cs.stackexchange.com/questions/356/why-hasnt-there-been-an-encryption-algorithm-that-is-based-on-the-known-np-hard |
| 17:04 |
asciilifeform |
it keeps coming back |
| |
↖ |
| 17:05 |
asciilifeform |
i walked compendia of known np-hard/np-complete problems, and found that all of them had same hole |
| 17:05 |
asciilifeform |
i.e. no known algo for constructing a known problem--solution pair, using rng, of ~known~ average complexity. |
| 17:06 |
asciilifeform |
incidentally ~all of the material is circa 1970s. |
| 17:06 |
asciilifeform |
(at least, of the public material!) |
| 17:07 |
BingoBoingo |
<mircea_popescu> 19yo female, bb. that's not occuring. << Frequent occurence. Typical hardware store is full of 19 year old girls. Even in the lumber section. Pinterest is a thing apparently. |
| 17:07 |
shinohai |
Because 19yo females like wood. |
| 17:08 |
asciilifeform |
mircea_popescu: i think i found it : http://btcbase.org/log/2016-02-05#1396876 |
| 17:08 |
a111 |
Logged on 2016-02-05 01:26 asciilifeform: mircea_popescu: played around with a few graph-theoretical approaches (in particular, max-clique problem) |
| 17:08 |
asciilifeform |
the thread. |
| 17:08 |
mircea_popescu |
i'm so fucking frustrated. no mention of hamiltonian cycles, no mention of blum who came up with it, nothing. what the fuck miserable idiot am i, can't reference anything properly. |
| 17:10 |
asciilifeform |
( next day, http://btcbase.org/log/2016-02-06#1397621 moar .) |
| 17:10 |
a111 |
Logged on 2016-02-06 02:49 mircea_popescu: actually the 4 color map thing is in my head just as good if not better than knapsack |
| 17:11 |
mircea_popescu |
http://btcbase.org/log/2016-02-06#1398003 << loller. |
| 17:11 |
a111 |
Logged on 2016-02-06 16:44 mircea_popescu: asciilifeform "- He says current block ciphers suck. Why? It doesn't really become clear from the discussion, which seems to be between two people who have heard a little bit about cryptography, and are trying to outdo each other in what little knowledge they have." |
| 17:11 |
BingoBoingo |
shinohai: Seriously go, observe |
| 17:11 |
mircea_popescu |
this seems very close, but not actually it wtf. |
| 17:11 |
BingoBoingo |
Wait, shinohai aren't you in Georgia! |
| 17:12 |
shinohai |
Yup |
| 17:13 |
mircea_popescu |
lel |
| 17:14 |
mircea_popescu |
asciilifeform it seems it's lost. sad. |
| 17:14 |
asciilifeform |
maybe it was a pm convo |
| 17:14 |
asciilifeform |
but evidently not with asciilifeform , because it dun turn up there |
| 17:15 |
mircea_popescu |
shit it was on trilema |
| 17:15 |
shinohai |
lol |
| 17:16 |
mircea_popescu |
http://trilema.com/2016/gossipd-design-document/#comment-118994 |
| 17:16 |
asciilifeform |
yes! |
| 17:16 |
asciilifeform |
theeere |
| 17:16 |
mircea_popescu |
hallelujah i was getting pretty depressed. |
| 17:17 |
asciilifeform |
metoo, i was quite convinced that i lost a set of l0gz to bitrot |
| 17:18 |
asciilifeform |
(and on raid5 no less) |
| 17:18 |
mircea_popescu |
anyway. to get back to the discussion, maybe something in the vein of blum's scheme may be applied to the ring problem |
| 17:18 |
mircea_popescu |
whereby you can verify one signed, but to find out which requires unwinding the whole graph. |
| 17:19 |
mircea_popescu |
verify the right one signed* |
| 17:19 |
mircea_popescu |
it would be fine if the security actually grew through being snowed in (ie, 0 difficulty to separate them on block 1, and growing from there each block, for all txn) |
| 17:19 |
* |
shinohai hopes mircea_popescu writes an article "In which I became lost in my own museum" |
| 17:20 |
mircea_popescu |
shinohai consider i'm not even 40 yet l/ |
| 17:20 |
shinohai |
To be fair, trilema is a big place. |
| 17:21 |
mircea_popescu |
but why be fair. |
| 17:22 |
BingoBoingo |
For Pig-Elliot! |
| 17:22 |
shinohai |
^ |
| 17:23 |
mircea_popescu |
lel |
| 17:24 |
asciilifeform |
mircea_popescu: let's suppose you had ring signature, we have edge of the sword. how does the hilt work ? i.e. you have an output, that is spendable, but you want it spendable by ~you~, not by 1,001 randomly-selected pubkeys. |
| 17:24 |
asciilifeform |
what's the spendability condition ? |
| 17:25 |
mircea_popescu |
let me restate because i'm not sure it's clear. |
| 17:27 |
mircea_popescu |
Let there be private keys K1...Kn. Let there be uxto associated with these, I1..Im so that any one I is associated with one and only one K. let there be a function S, so that the verification function V(Kx, S(Iy)) is always false, or uncomputable, or whatever whereas V(K1..Kn, S(Iy)) is always true if and only if the K Iy is associated to signed it. |
| 17:29 |
mircea_popescu |
ie, if K3 owns input I5, and if K3 signs I5, then it can be verified that the ring composed of K3, K4, K7, K9 a) signed I5, and b) owned I5 to sign it ; but it can't be verified that any subgroup didn't own I5. |
| 17:29 |
mircea_popescu |
for the needs of this contortion, K3, K4, K9, K11 is a subgroup of K3, K4, K7, K9 |
| 17:29 |
mircea_popescu |
now -- this is the fantasy. |
| 17:30 |
asciilifeform |
oook i getit |
| 17:30 |
asciilifeform |
the good noose : i don't know a proof that you ~can't~ do this... |
| 17:30 |
mircea_popescu |
yeah me either |
| 17:31 |
mircea_popescu |
(i've been thinking about this thing ever since fluffypony first spoke in channel, but hey. i';ve nothing meaningful to show for it.) |
| 17:31 |
asciilifeform |
and yeah this is the squared-circle from couplaedaysago |
| 17:31 |
asciilifeform |
the crackpots have been at it since before chaum, |
| 17:31 |
asciilifeform |
and the charlatans -- since; and quite vigorously |
| 17:31 |
asciilifeform |
(recall the zero-whatvrs, how many of those alts by now.) |
| 17:31 |
mircea_popescu |
yeah. |
| 17:33 |
asciilifeform |
can anybody remind me of how shamir&rivest's original algo fails |
| 17:33 |
asciilifeform |
(it nominally solved this problem) |
| 17:34 |
thestringpuller |
!~later tell danielpbarron http://wotpaste.cascadianhacker.com/pastes/VG61w/?raw=true |
| 17:34 |
jhvh1 |
thestringpuller: The operation succeeded. |
| 17:34 |
asciilifeform |
all i recall is old thread, http://btcbase.org/log/2016-08-30#1532069 |
| 17:34 |
a111 |
Logged on 2016-08-30 17:29 asciilifeform: davout: 'ring signatures' are not the promised 'invisibility cloak', but more of a smoke grenade. |
| 17:35 |
asciilifeform |
^ where my contention was, you can factor out the signer using multiple sets of shamirized sigs |
| 17:35 |
asciilifeform |
by process of elimination . |
| 17:36 |
mircea_popescu |
that's where it fails, "but it can't be verified that any subgroup didn't own I5." |
| 17:36 |
mircea_popescu |
there's a very directly computable homomorphism, the item being you know, the algebraic ring. |
| 17:36 |
mircea_popescu |
it's ~worth nothing that "hurr durr, riong signatures" when i can degraqde it by trying subgroups until i hit yours. |
| 17:38 |
asciilifeform |
say, today, k3, k4, k7, ... , k9 sign. tomorrow, k7, k21, k3, ... , k333. next day, k42, k3, ... whatever. now 'you can't verify that no subgroup...' ~within~ the algo, but someone who has the whole list and notices that only k3 recurrs... |
| 17:38 |
asciilifeform |
if he has half a brain -- knows which k. |
| 17:38 |
mircea_popescu |
actually i suspect it can be proven that in any ordered set with two operations which admit distinct id operators / are commutative this property can't exist. |
| 17:39 |
mircea_popescu |
asciilifeform that is ok. |
| 17:39 |
asciilifeform |
mircea_popescu: how's that. the seekrit, is blown, neh |
| 17:39 |
mircea_popescu |
re the above line : all rings are right out, basically. |
| 17:39 |
asciilifeform |
i suspect so |
| 17:39 |
mircea_popescu |
asciilifeform operator error. |
| 17:39 |
asciilifeform |
mircea_popescu: would be interesting to tally the avg case cost of not committing this error. |
| 17:40 |
asciilifeform |
(of guarantee of not committing it) |
| 17:40 |
mircea_popescu |
it is computable and this is good enough for me. |
| 17:40 |
mircea_popescu |
this item definitely counts for your grand list of trb-isms. on the strength of that, "computable", i ask no more. |
| 17:41 |
asciilifeform |
there's computables and there's computables-and-doables. unfortunately distinct sets in practice. |
| 17:41 |
asciilifeform |
(if you need a jupiter-sized machine, it isn't very hotstuff algo-wise) |
| 17:41 |
mircea_popescu |
matters not. technological improvement is technological improvement. |
| 17:41 |
asciilifeform |
dunno re mircea_popescu's planet, on mine, semiconductors sorta stopped, in 2009-ish, and aren't threatening to develop mega-improvement |
| 17:42 |
mircea_popescu |
nevertheless. |
| 17:42 |
mircea_popescu |
anyway, the useful research in nonalgebraic sets is, at least to my (admittedly limited) knowledge entirely absent. |
| 17:43 |
asciilifeform |
you will find that many 'wouldn't that be useful..' items are ~entirely absent in the public lit. and no prizes for guessing why. |
| 17:43 |
mircea_popescu |
myeah. |
| 17:43 |
asciilifeform |
i dug for the can-guarantee-avg-case-np-hard? thing -- found zip. |
| 17:43 |
mircea_popescu |
anyway, lattices. psshhh. |
| 17:44 |
mircea_popescu |
give me a non-algebraic set with interesting operations instead. |
| 17:44 |
asciilifeform |
( asciilifeform also has pretty strong bias against mechanically-complicated crypto. ) |
| 17:44 |
asciilifeform |
it is very easy to 'zerocoin'erize. |
| 17:44 |
asciilifeform |
(or was it zcashulation ? ) |
| 17:44 |
asciilifeform |
i can never keep the 2 straight. |
| 17:44 |
mircea_popescu |
fucking art students wasting their life with http://jezebel.com/heres-a-woman-plopping-paint-eggs-out-of-her-vagina-1566693939 |
| 17:45 |
asciilifeform |
oh lol that chick |
| 17:45 |
asciilifeform |
she's in the l0gz |
| 17:45 |
mircea_popescu |
myeah. |
| 17:47 |
mircea_popescu |
asciilifeform anyway, as an entirely idle example : the set of numbers with mpfhf defined on it is actually a fine example in this vein. it ISNT an algebraic structure ; but an algorithmic structure. |
| 17:47 |
asciilifeform |
to revisit the smoke grenade -- how do you deal with the unopposability of having paid for something ? |
| 17:48 |
mircea_popescu |
i dunno, say politically. if you decide to claim tomorrow that there never was such a thing as c3, how do i deal with it ? |
| 17:48 |
asciilifeform |
or does payee get told the secret over separate (say, rsa'd) channel |
| 17:48 |
mircea_popescu |
or yes i was about to say that. |
| 17:48 |
asciilifeform |
because that'd work |
| 17:49 |
asciilifeform |
(in so far as payee can be trusted to stfu forever) |
| 17:49 |
mircea_popescu |
even something as simple as -- ammt made it, therefore paid is good enough really. |
| 17:50 |
asciilifeform |
the amts aren't secret, per the scheme, though |
| 17:50 |
mircea_popescu |
indeed. |
| 17:50 |
asciilifeform |
someone else can pay him same amt. and then to whom does he send the plutonium. |
| 17:50 |
mircea_popescu |
same way fuckgoats works neh. |
| 17:51 |
asciilifeform |
well not quite, we do store the pgp'd orders |
| 17:51 |
mircea_popescu |
so what's the problem ? |
| 17:51 |
mircea_popescu |
as long as right amt showed up -- right amt showed up, proceed. |
| 17:51 |
asciilifeform |
i guess this isn't one of the problems. |
| 17:52 |
mircea_popescu |
notrly. |
| 17:52 |
asciilifeform |
( i can't think of any reason why payee would care if payer A, or B, had supplied the agreed-upon amount ) |
| 17:53 |
asciilifeform |
so long as they are guaranteed to be distinct at every step in time |
| 17:55 |
mircea_popescu |
the important point here is exactly this - that it should no longer be possible to meaningfully talk of "payer". |
| 17:55 |
mircea_popescu |
just payments. no payers. fuck usg. |
| |
↖ ↖ |
| 17:55 |
asciilifeform |
well yes, this'd be implicit in ring sig. |
| 17:55 |
mircea_popescu |
just fucks, no fuckers. tananana. |
| 17:56 |
asciilifeform |
!#s martian bank |
| 17:56 |
a111 |
12 results for "martian bank", http://btcbase.org/log-search?q=martian%20bank |
| 17:57 |
danielpbarron |
!~later tell thestringpuller http://wotpaste.cascadianhacker.com/pastes/qo014/?raw=true |
| 17:57 |
jhvh1 |
danielpbarron: The operation succeeded. |
| 17:58 |
asciilifeform |
( http://btcbase.org/log/2016-10-20#1557335 thread , and elsewhere ) |
| 17:58 |
a111 |
Logged on 2016-10-20 20:37 asciilifeform: ('martian bank' being simply a naive abstraction of 'idealizes swiss bank', where money supply is constant, and i can send from account a1 can send to a2 if and only if i have the privkey for a1, and double-spend - impossible, etc.) |
| 18:09 |
asciilifeform |
mircea_popescu: btw 'no payers, only payments' is probably impossible with public balances existing in any sense. |
| 18:10 |
asciilifeform |
if balances are visible -- anyone can see that addr A had a payment-P-shaped chunk subtracted from it at time T. |
| 18:11 |
asciilifeform |
esp. if everyone is in the habit of using all of the decimal places of P as an invoice id. |
| 18:12 |
asciilifeform |
i suppose this is why mircea_popescu wanted the 2-input thing. |
| 18:12 |
mircea_popescu |
i don't see public balances are useful. |
| 18:12 |
mircea_popescu |
tx verification is good enough. |
| 18:12 |
asciilifeform |
how do you verify without public balances ? |
| 18:12 |
asciilifeform |
now you also want homomorphic arithmetic, looks like |
| 18:12 |
mircea_popescu |
i think i always did. |
| 18:12 |
asciilifeform |
'we're squaring circles, may as well make perpetuum mobile and immortality' |
| 18:12 |
mircea_popescu |
hey. |
| 18:13 |
mircea_popescu |
anyway, the idea is you verify balance when spent ; not before. |
| 18:13 |
mircea_popescu |
the chain of beneficiaries can obv verify the balance, but "public" can not. |
| 18:13 |
asciilifeform |
can third party calculate the monetary mass ? |
| |
↖ |
| 18:13 |
mircea_popescu |
nope. |
| 18:13 |
asciilifeform |
because if not , you have the fed. |
| 18:13 |
mircea_popescu |
can only verify blockchain. |
| 18:14 |
mircea_popescu |
no, because public can verify all blocks are valid. |
| 18:14 |
asciilifeform |
valid also means 'nobody gets to printolade' |
| 18:14 |
mircea_popescu |
(and -- suddenly have an incentive to, too! because if they don]'t.... fed) |
| 18:14 |
mircea_popescu |
indeed. |
| 18:15 |
asciilifeform |
which means that i gotta be able to prove that monetary mass is what the mining curve says it is. and not something else. |
| 18:15 |
mircea_popescu |
not necessarily in these terms. |
| 18:15 |
mircea_popescu |
it suffices to prove that all outputs without an input are proper block rewards. |
| 18:16 |
asciilifeform |
that doesn't prove that monetary mass was not somehow added during noncoinbase ops |
| 18:16 |
asciilifeform |
i.e. that some output, somewhere, yielded moar coin than the sum of the inputs. |
| 18:16 |
mircea_popescu |
how did the tx verify ? |
| 18:17 |
asciilifeform |
that's more or less equivalent to my question |
| 18:18 |
mircea_popescu |
i guess. |
| 18:18 |
asciilifeform |
which is , how would you have such a thing as a sanely-behaving balance to begin with |
| 18:18 |
mircea_popescu |
here's the idea : currently, you only know the pubkey for a bitcoin address once it spends ; before it spends you do not know its pubkey. |
| 18:18 |
mircea_popescu |
the ~same should be extended to amounts. |
| 18:19 |
asciilifeform |
one simple way to do this, is to dispense with amounts (as discussed in at least 2 old threads) |
| 18:19 |
asciilifeform |
i.e. danielpbarron's vectors |
| 18:19 |
asciilifeform |
no moar coin breaking. |
| 18:19 |
mircea_popescu |
not sure that's necessary ; the true argument against "amounts" is that well... again, the 0.25 problem ; http://btcbase.org/log/2017-02-28#1619936 |
| 18:19 |
a111 |
Logged on 2017-02-28 13:11 mircea_popescu: practically speaking on current tech the bitcoin unit of account is probably something like 0.25 |
| 18:19 |
mircea_popescu |
stop lying, txn = unit of account. |
| 18:19 |
asciilifeform |
think dubloons, rather than pieces-of-eight. |
| 18:20 |
asciilifeform |
amounts suck. |
| 18:20 |
mircea_popescu |
counterintuitively enough they actually do. |
| 18:20 |
mircea_popescu |
it is, cards on the table, more of a buried lie than ~anything else in the "protocol" |
| 18:25 |
asciilifeform |
it is one of the major leaks in the vacuum piping |
| 18:25 |
asciilifeform |
in that one party creates the sharp broken edge, but very other people have to live with the cost. |
| 18:26 |
asciilifeform |
~100% of asciilifeform's line of thought re 'trbi', from this, to the casks thing, etc., was only 'how to plug the leaks' |
| 18:26 |
asciilifeform |
what are ~all~ of the places where A has the ecstasy, but B does the laundry, where A!=B |
| |
↖ ↖ ↖ ↖ ↖ ↖ ↖ |
| |
~ 27 minutes ~ |
| 18:54 |
asciilifeform |
oooh gotta revisit upstack, briefly, http://btcbase.org/log/2017-03-01#1620677 << ~this~ in particular cannot be done as written. else, the first relayer of a freshly mined block could simply steal the work that went into determining luby(Z) and get massive head start on making his own block, which he then relays instead of the plagiarized. |
| 18:54 |
a111 |
Logged on 2017-03-01 19:51 asciilifeform: .... another pill against 'waltzers' : Z depends on the ~previous~ block. |
| 18:54 |
mircea_popescu |
!!up john_cocktail |
| 18:54 |
deedbot |
john_cocktail voiced for 30 minutes. |
| 18:54 |
asciilifeform |
(the fact that the original victim could, normally, relay his original faster than a typical plagiarist could hash, is immaterial, it is still a potential vuln) |
| 18:55 |
asciilifeform |
and actually now that i think about it, it'd be guaranteed-lethal |
| 18:55 |
asciilifeform |
the plagiarist can make a block with higher PoW than the victim, ~every time, since he isn't handicapped by having to compute L(Z) |
| 18:56 |
asciilifeform |
and reorg will favour him. |
| 18:56 |
BingoBoingo |
john_cocktail: Who is your daddy and what does he do? |
| 18:56 |
mircea_popescu |
that part wasn't included :p |
| 18:56 |
asciilifeform |
(so L ~must~ use current block.) |
| 18:56 |
john_cocktail |
i gave birth to myself |
| 18:56 |
john_cocktail |
so he is i |
| 18:58 |
john_cocktail |
but really, I've recently found myself reading the logs and wanted to stop by |
| 18:59 |
john_cocktail |
intelligent conversation about crypto isn't easy to find, on the internet or anywhere else |
| 19:03 |
Framedragger |
amen to that, mr. cocktail. |
| 19:03 |
asciilifeform |
welcome , john_cocktail |
| 19:04 |
asciilifeform |
mircea_popescu: the cure, i realized, is that ~some~ of the oldtx selected by Z must depend on value of prev block, so as to prevent waltzing of Z 'until all i need is the 10% i'm fraudulently storing instead of the 100%' . |
| 19:05 |
asciilifeform |
sorta how student might get to select a few exam questions from a pool, but there are others that are mandatory. |
| 19:05 |
mircea_popescu |
it;s not entirely certain this is needed, even. |
| 19:05 |
mircea_popescu |
anyway, the exact way to apply luby to it prolly can take more thinking. but hte idea certainly has merit. |
| 19:05 |
asciilifeform |
no, but it may be needed to get absolute certainty. |
| 19:07 |
asciilifeform |
the one thing that definitely cannot be permitted to be manipulable by a waltzer is the arity. (there'd be overwhelming incentive to waltz for minimal arity) |
| 19:10 |
mircea_popescu |
yeah. |
| 19:11 |
mircea_popescu |
any |
| 19:11 |
mircea_popescu |
anyway, re ^ : romanian mythical-hero math professor (moisil) famously allowed students to pick questions. |
| 19:12 |
mircea_popescu |
"you can't know math PARTIALLY well." |
| 19:12 |
asciilifeform |
pretty much |
| 19:12 |
* |
asciilifeform had a prof who permitted students to bring 'all of the crib sheets and books you can carry on your miserable back, it won't help' |
| 19:13 |
asciilifeform |
'bring whatever calculator, bring supercomputer if you like' |
| 19:13 |
mircea_popescu |
brin ? |
| 19:13 |
asciilifeform |
who else. |
| 19:13 |
mircea_popescu |
aha. |
| 19:18 |
asciilifeform |
but, upstack, conundrum is, if some of the oldtx depend on prevblock in a way that is known immediately when said block was mined -- it gives a head start to plagiarists ( per earlier observation -- folx who take a freshly-mined block and try to make ~replacement~ for it with higher PoW.) but if they are ~not~ immediately known, and depend in any way on waltzeable Z, then 'haha i'll waltz until it falls in my 10%'. |
| 19:19 |
mircea_popescu |
however forcing one to keep A PORTION of blockchain is not altogether a bad outcome ; it is better than the current "forces to keep nothing -- and they provably, as historical fact, DID NOT!" and through lubby ensures blockchain is never lost. |
| 19:19 |
asciilifeform |
so it seems to me that what remains is to up the arity -- find such arity that any attempt at such waltzing is guaranteed to be ~useless |
| 19:20 |
asciilifeform |
or this. |
| 19:20 |
mircea_popescu |
to make it perfectly clear -- the reason blockchain still exists today is not the 2015 miners. |
| 19:20 |
asciilifeform |
yea |
| 19:21 |
asciilifeform |
the snake, lost his legs, aha. |
| 19:21 |
asciilifeform |
didn't need'em. |
| 19:21 |
mircea_popescu |
aha |
| 19:29 |
danielpbarron |
is it possible to do a lossless pruning on this lubby thing? say some chunk of data kept in an early blk.dat can be removed and the whole thing still verifies because the missing piece can be re-produced from data in more recent blk.dat ? |
| 19:31 |
asciilifeform |
danielpbarron: it is possible to make a hole through a man's torso , in such a way that he does not die. but not desirable. |
| 19:31 |
mircea_popescu |
deedbot to 1/3rd or such |
| 19:32 |
mircea_popescu |
i mean danielpbarron |
| 19:33 |
asciilifeform |
and yes you can compute the odds of a particular block B ending up wholly lubyized by a time T. however if you rely on the luby strings for your mining, you will be fucked timewise. |
| 19:33 |
asciilifeform |
if you want to competitively mine, you gotta have the blox in O(1) at your fingertip. |
| 19:34 |
danielpbarron |
if you don't care about mining though? |
| 19:34 |
danielpbarron |
and if you ever decided to mine, you could use what you have to make the rest |
| 19:34 |
mircea_popescu |
it still wouldn't be true pruning. |
| 19:34 |
mircea_popescu |
just... a sort of zipping |
| 19:34 |
asciilifeform |
mircea_popescu is right, i waas abouittosay |
| 19:34 |
asciilifeform |
it is simply compression |
| 19:35 |
asciilifeform |
you replace a block you know to have been fully lubyized with a 'if you want this, go and find'. BUT what, now you have an empty string there .. |
| 19:35 |
asciilifeform |
how does this save you any effort |
| 19:35 |
asciilifeform |
blocks are, recall, constant size, if you want O(1) block fetching (and as a verifying node, you certainly do) you win 0 by compressing. |
| 19:35 |
asciilifeform |
you still have a block-shaped hole occupying every slot. |
| 19:35 |
asciilifeform |
'pruning' is for the birds, folx. |
| 19:36 |
asciilifeform |
it is a notion fundamentally incompatible with sanity. |
| 19:37 |
mircea_popescu |
asciilifeform without some kind of http://btcbase.org/log/2017-02-27#1619177 the situation is apperoximately one where naive idiots got their wish, and no bacteria exist. |
| 19:37 |
a111 |
Logged on 2017-02-27 16:56 mircea_popescu: but the correct trb-i might just as well end up this situation where block reward is 1mn bitcoin, and it dies within 1mn blocks. so all mining does is produce ~ a lease ~ on a chunk of bitcoin. and the value of old bitcoin is monotonically decreasing over their lifetime. |
| 19:38 |
mircea_popescu |
lenin, as well as everyone else, can still be admired exactly as they were |
| 19:38 |
mircea_popescu |
and an apple costs a fortune. |
| |
↖ |
| 19:38 |
asciilifeform |
a nonfungible coin is not very interesting. |
| 19:38 |
asciilifeform |
( i was convinced of this very quickly after coming up with my 'shitcoin' thing ) |
| 19:38 |
mircea_popescu |
there is that. |
| 19:39 |
mircea_popescu |
incidentally, a non-amounts coin is by definition unfungible. |
| 19:39 |
asciilifeform |
well unless you also have the ring thing |
| 19:39 |
mircea_popescu |
aha! |
| 19:39 |
mircea_popescu |
you're starting to grok this. |
| 19:39 |
danielpbarron |
that's where quality comes in. perhaps you can mix old coins with new and the result is somewhere in the middle 'age' wise. and when coin's quality reaches 0 it stops existing |
| 19:39 |
asciilifeform |
that's kinda what we have now neh |
| 19:39 |
asciilifeform |
dust is 'quality reached 0' |
| 19:40 |
mircea_popescu |
not really. i can still send dust. |
| 19:40 |
asciilifeform |
not if per-kb fee makes it -ev neh |
| 19:41 |
mircea_popescu |
coin age baby. |
| 19:41 |
mircea_popescu |
mindblowingly, still a thing in 2017. |
| 19:41 |
asciilifeform |
miners could piss on coin age starting tonight, if they felt like it. |
| 19:41 |
mircea_popescu |
but they apparently don't. |
| 19:41 |
asciilifeform |
they don't, because apparently this 'bus' is ~empty |
| 19:42 |
asciilifeform |
( asciilifeform freshly re-read mircea_popescu's 'empty airplanes' thing ) |
| 19:42 |
asciilifeform |
it also helps that the current crop of miners is almost clinically retarded |
| 19:42 |
mircea_popescu |
not a bad piece if i do say so myself. but yes, perhaps that's what it is. |
| 19:43 |
asciilifeform |
but , upstack, when i think about trbi i go into 'bridge design' mode, where 'it gotta bear all of the tanks that could possibly physically fit, and then let's also assume that martians stack'em five layers deep ' |
| 19:44 |
asciilifeform |
rather than the current '~nobody actually uses bitcoin' situation |
| 19:45 |
asciilifeform |
idea being, any 'ecological' problem, with, e.g., algorithmic complexities as t-->+inf, can seem insignificant -- but enemy can waltz it into an actual problem. |
| 19:45 |
asciilifeform |
in something short of 'ecological' timespans, even. |
| 19:46 |
asciilifeform |
( witness the effects of the 900+kB of rubbish that usg is piping into each block today ) |
| |
~ 28 minutes ~ |
| 20:15 |
asciilifeform |
mircea_popescu: incidentally i suspect that a regenesised fork would begin to gather steam long before http://btcbase.org/log/2017-03-02#1621006 . |
| 20:15 |
a111 |
Logged on 2017-03-02 00:38 mircea_popescu: and an apple costs a fortune. |
| 20:15 |
mircea_popescu |
the principle of the thing. |
| 20:15 |
asciilifeform |
( in meatspace this is also known as 'civilizational death' and happens regularly ) |
| 20:16 |
asciilifeform |
explicit 'telomeres' are still mega-improvement over the old state of the art . |
| 20:17 |
asciilifeform |
this goes immediately back to mircea_popescu's koschei piece. |
| 20:18 |
mircea_popescu |
all the weird, pointless random shit on trilema that has nothing to do with anything! |
| 20:19 |
asciilifeform |
lelz |
| 20:20 |
mircea_popescu |
anyway. laterz. |
| |
~ 1 hours 26 minutes ~ |
| 21:47 |
PeterL |
while we are talking about things to stick in TRB-I, how about lowering the block size by an order of magnitude or so? |
| 21:48 |
PeterL |
decrease the total disk usage, and improve the txn fee market, win/win, right? |