saopaulobitdevs / saopaulobitdevs.org

São Paulo Bitdevs
https://saopaulobitdevs.org
MIT License
12 stars 5 forks source link

Topicos Junho 2024 #29

Closed oleonardolima closed 2 months ago

oleonardolima commented 2 months ago

Issue para sugestao de topicos pro encontro de Junho.

Por favor incluam suas sugestoes no seguinte formato para facilitar a vida dos editores:

Desculpa pelo front-running @lorenzolfm 😅

oleonardolima commented 2 months ago

Proposing a P2QRH BIP towards a quantum resistant soft fork https://delvingbitcoin.org/t/proposing-a-p2qrh-bip-towards-a-quantum-resistant-soft-fork/956

oleonardolima commented 2 months ago

Burak Introduces Ark v2 with Liquidity-efficient Design https://www.nobsbitcoin.com/burak-introduces-ark-v2-design/ https://brqgoo.medium.com/introducing-ark-v2-2e7ab378e87b

oleonardolima commented 2 months ago

Amboss Lightning Decoder https://primal.net/e/note16qlmfdj0tjadvtq8vuwwxa3zuvvs4l9m77ryrq7ttm2xd9vj0g4sfy7tnj https://amboss.space/lightning-decoder

oleonardolima commented 2 months ago

A new BOLT12 website https://bolt12.org/ https://primal.net/e/note1w6wh63r82chfz7g5rkzpfs9wh6z57qq2xa0llmsqxd606h9h4rcqffv2e4

oleonardolima commented 2 months ago

Differential Fuzzing of Bitcoin implementations https://delvingbitcoin.org/t/differential-fuzzing-of-bitcoin-implementations/208/6

oleonardolima commented 2 months ago

Payjoin Release v0.17.0 https://github.com/payjoin/rust-payjoin/releases/tag/payjoin-0.17.0

j-moreno-c-r commented 2 months ago

This link is more symbolic, the topic is more important, windos will start to print the screen, officially... https://support.microsoft.com/pt-br/windows/copilot-no-windows-seus-dados-e-privacidade-3e265e82-fc76-4d0a-afc0-4a0de528b73a

j-moreno-c-r commented 2 months ago

https://primal.net/e/nevent1qqs0w0dk949gga58ngmpajwgmtlj2aqutpghglysulewgrg8tcudtugpp4mhxue69uhkummn9ekx7mqzyp9636rd9ktcjmwfxd7ru5qxjxyn6uch2uhas8utg8wa5hvf6vk7ggpugdn Translation of a god text about PGP, for Alex emidio

oleonardolima commented 2 months ago

DoS: LND Onion Bomb https://morehouse.github.io/lightning/lnd-onion-bomb/

oleonardolima commented 2 months ago

How Silent Payments Work https://medium.com/@ottosch/how-silent-payments-work-41bea907d6b0

storopoli commented 2 months ago

BitcoinJ ran out of space (12-byte SIGNED integer) to encode chain work data: https://github.com/bitcoinj/bitcoinj/issues/3410

The fix was to make the 12-byte UNSIGNED integer which kicks this a little bit down the road: https://github.com/bitcoinj/bitcoinj/commit/fae543bb6d4a72d6081d64dc1fde513229004c7c

This made Bisq crash and need a very fast hotfix: https://github.com/bisq-network/bisq/commit/3a84f18d2bc464d6cf24f32e2d3a0e02ce31bfe8

PS: with 5 tabs of Java code open in my browser the Geiger counter is going crazy... 💀

storopoli commented 2 months ago

Let's add cryptographic nerdy stuff.

Constant-time analysis tool cargo-checkct announced: A Ledger blog post announced cargo-checkct, a tool that evaluates whether Rust cryptographic libraries run in constant time to avoid timing attacks.

storopoli commented 2 months ago

Joinstr adds electrum support: Coinjoin software joinstr added an electrum plugin.

Tutorial.

storopoli commented 2 months ago

Proposing a P2QRH BIP towards a quantum resistant soft fork https://delvingbitcoin.org/t/proposing-a-p2qrh-bip-towards-a-quantum-resistant-soft-fork/956

So, in a VERY hand-weaving overview: DLP (Discrete log problem) and prime factorization, technologies both used in EC (Elliptic Curve) and RSA signatures, are hard problems (related to negligible functions) for classical computers, but not for quantum computers.

Hence, we need to find other sources of hard problems that are quantum resistant. One major candidate of problems is to use Lattices problems such as Shortest vector problem (SVP) and Closest vector problem (CVP), which, for now, we don't have a very efficient quantum algorithm to solve. So, they are still "hard". (A nice accessible overview by quanta magazine)

Now this SQISign proposed in the BIP, is based on "Isogeny graphs of supersingular elliptic curves" which seems to be a "hard" problem (see theorem 1 of section 3.2 in the PDF of the paper) for both classical and as well quantum computers:

The security of these schemes relies on the hardness of finding a path in the $\ell$-isogeny supersingular graph between two given vertices. This problem is believed to be hard for both classical and quantum computers

Ref: Wikipedia on Supersingular isogeny graph.

Should be fun 😂

EDIT: Signal post-quantum crypto protocol relies on the Lattice hard stuff.

brunoerg commented 2 months ago

Novos bugs encontrados pelo bitcoinfuzz!

https://delvingbitcoin.org/t/differential-fuzzing-of-bitcoin-implementations/208/5