Medijski sadržaj
- Tweetovi
- Tweetovi i odgovori
- Medijski sadržaj, trenutna stranica.
-
Experimented with and threw away 600 lines of code for storing consensus-related data to LevelDB. Atomic transactions in syndtr/goleveldb are slow
. #golangpic.twitter.com/yb5glUsjcI
-
Abstracting away the BFT consensus protocol I gave a talk on in SFBW 2019 into a general-purpose Go package.
#golang#blockchain@PerlinNetworkpic.twitter.com/3dI9nge9cX
-
-
Neat and fun little abstraction pattern for creating atomic database helper methods with syndtr/goleveldb.
#golangpic.twitter.com/194kfclhpl
Prikaži ovu nit -
Finished up an initial gossip protocol implementation on Noise with tests and documentation. https://github.com/perlin-network/noise/pull/272 …
#golang#p2p@PerlinNetworkpic.twitter.com/ksIxMx7sPW
Prikaži ovu nit -
Writing a gossip protocol plugin over a Kademlia overlay network for Noise. This test demonstrates how the XOR distance metric over peer IDs asserts that peers are well-connected (with a lot of assumptions of course!).pic.twitter.com/Qn1cqAnDFf
-
Weekends are a good time to code
. #golang#noise$perl https://github.com/perlin-network/noise/pulls?q=is%3Apr+is%3Aclosed …pic.twitter.com/yD40DYk5p0
-
Now I need to find an alternative to Ristretto
#golang.pic.twitter.com/JtA6EsEAYe
-
Released Noise v0.1: a decentralized p2p networking lib in
#golang. Tons of performance/security fixes + features (docs, examples, connection pooling, search for peers by public key, etc.). Will write up a post tmrw; gonna sleep it's 1AM.@PerlinNetwork https://github.com/perlin-network/noise …pic.twitter.com/Oo5htqJl5N
-
"So, how do you efficiently count how many non-zero bytes there are in a byte slice?"
#golangpic.twitter.com/zB3T12sjHF
Prikaži ovu nit -
Anyone know any
#golang articles that dives deep into unsafe hacks like converting arbitrary values into a slice of bytes?pic.twitter.com/qANrM4rJRt
-
-
-
-
We explicitly made the critical transaction puzzle difficult to grind/mine against to prevent such attacks from happening. I attached some photos from the paper that show some measures we made to account for this.pic.twitter.com/eDvZlX3BOh
-
You got it. I will share it either tomorrow in the next three days max; will request the auditor to write up a bit of documentation for it.pic.twitter.com/SElcTQbfhn
-
Hold up: the proof is correct. More correct so than what is specified in the Avalanche whitepaper. I specifically defined the lemma of strong liveness as _eventual_ termination. I have emphasized this in the whitepaper below the proofs.pic.twitter.com/4FUSCPc5hG
-
(just to clarify, this is with 1000-way concurrency)pic.twitter.com/0ebG1Gzv3t
-
Is there any sort of explicit flow control in Cap'n Proto? Trying it 1000-way there are improvements, though huge spikes of latency in between messages sent. I can only infer that there is some batching mechanism in Cap'n Proto, and not necessarily any flow control mechanism.pic.twitter.com/Pzx6ldc3aA
Čini se da učitavanje traje već neko vrijeme.
Twitter je možda preopterećen ili ima kratkotrajnih poteškoća u radu. Pokušajte ponovno ili potražite dodatne informacije u odjeljku Status Twittera.
key exchange/aead/handshake...