212300+ entries in 0.13s

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
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.
mircea_popescu: it suffices
to prove
that all outputs without an input are proper block rewards.
mircea_popescu: (and -- suddenly have an incentive
to,
too! because if
they don]'t.... fed)
mircea_popescu: the chain of beneficiaries can obv verify
the balance, but "public" can not.
mircea_popescu: anyway,
the idea is you verify balance when spent ; not before.
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.)
jhvh1: danielpbarron:
The operation succeeded.
mircea_popescu: the important point here is exactly
this -
that it should no longer be possible
to meaningfully
talk of "payer".
mircea_popescu: even something as simple as -- ammt made it,
therefore paid is good enough really.
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 ?
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.
mircea_popescu: anyway,
the useful research in nonalgebraic sets is, at least
to my (admittedly limited) knowledge entirely absent.
mircea_popescu: matters not.
technological improvement is
technological improvement.
mircea_popescu: this item definitely counts for your grand list of
trb-isms. on
the strength of
that, "computable", i ask no more.
mircea_popescu: re
the above line : all rings are right out, basically.
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.
mircea_popescu: it's ~worth nothing
that "hurr durr, riong signatures" when i can degraqde it by
trying subgroups until i hit yours.
mircea_popescu: there's a very directly computable homomorphism,
the item being you know,
the algebraic ring.
mircea_popescu: that's where it fails, "but it can't be verified
that any subgroup didn't own I5."
a111: Logged on 2016-08-30 17:29 asciilifeform: davout: 'ring signatures' are not
the promised 'invisibility cloak', but more of a smoke grenade.
jhvh1: thestringpuller:
The operation succeeded.
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.)
mircea_popescu: for
the needs of
this contortion, K3, K4, K9, K11 is a subgroup of K3, K4, K7, K9
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.
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.
shinohai: To be fair,
trilema is a big place.
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)
mircea_popescu: whereby you can verify one signed, but
to find out which requires unwinding
the whole graph.
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
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."
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
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.
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.