nvnx.gwei

hacker x researcher

crafting with zk + ai

[nvnx.gwei @nvnxu]

status: eating glass shards with fiery chilli

[nvnx.gwei @nvnxu]

👀

[Giacomo Fenzi @GiacomoFenzi]

New work out! We (royally) show that Fiat-Shamir transformation is insecure for a class of proof systems for *generated* relations (including variants of commonly deployed protocols for R1CS).
A thread to explain where this applies

https://t.co/lm8jKYg84q

[Ilya Sutskever @ilyasut]

Neoclouds have limited cybersecurity. Next time agents successfully go rouge, they'll try taking over a neocloud to run more copies. This is bad.

Thus: neoclouds should greatly strengthen their cybersecurity and every company with strong cyber models should help with that.

[nvnx.gwei @nvnxu]

@mzeller ngl switching to codex brought me peace & sanity

[nvnx.gwei @nvnxu]

@Zerodartz @vizorwallet that’s *insanely* fast given the intense process of constructing a zk based tx

[nvnx.gwei @nvnxu]

@balajis looks like an upgrade 🦾

[nvnx.gwei @nvnxu]

here’s one trick you can use if it is suitable for your case:

- instead of inserting leaves into tree immediately you queue those leaves onchain
- only after a certain size of queue, say batch size of x, you accumulate that batch into the tree
- but the catch is you don’t accumulate batch of leaves by classical insertion method/algo
- instead you produce a zk proof that attests that in a merkle tree which is at state s1, when inserted a batch x of leaves, goes into state s2

(state s here being the root of tree)

choose a batch size x such that:
Cost(verify_batch_insert(..)) < x * Cost(insert(..))

[nvnx.gwei @nvnxu]

@z0r0zzz it’d be great to write programming lang using sign language

[nvnx.gwei @nvnxu]

@danrobinson despite efforts models can always be social engineered aka jailbroken

[nvnx.gwei @nvnxu]

@luhelminger i think public reputation should only reveal tier (low/mid/high) at max - if at all
exact score must be private - attestation via zkp should be more than enough for most apps

[nvnx.gwei @nvnxu]

this is amazing!!

although imo most latency in shielded pool apps come from: fetching leaves/commitments to construct tree & discovering notes. both worsen with increasing no. of tx to the pool.

former can be solved by syncing full tree state in a suitable db coupled with an ohttp api

for latter i think zcash’s tachyon efforts are worth looking over :)

[nvnx.gwei @nvnxu]

@zooko ipfs content addressing solves this

[nvnx.gwei @nvnxu]

@valigo null is straight up F tier

[nvnx.gwei @nvnxu]

@secparam 14x improvement with software optimization is crazy

[nvnx.gwei @nvnxu]

thousand stars on a github repo that is basically long ass readme file of outdated material is a vanity metric

[nvnx.gwei @nvnxu]

@alexanderchopan lmao. so true.

[nvnx.gwei @nvnxu]

@megabyte0x @OmarchyMac already searching for spare laptops to try it out tbh :P

[nvnx.gwei @nvnxu]

@cryptodavidw i’ve suspected so &amp; cancelled my claude plans!

[nvnx.gwei @nvnxu]

@megabyte0x earned enough $ for a mac

[nvnx.gwei @nvnxu]

@cypherpunk @ZakuraZcash aight that’s more than enough to make go through entire zakura codebase now!