Ajay Maurya
252 posts

Ajay Maurya
@AjayMauryabbn
Doing some AI stuff Having fun
Bengaluru Katılım Ocak 2022
120 Takip Edilen38 Takipçiler

How do you do journalism with such thin skin?
Oh wait... you don't 🤣

Arnav Gupta@championswimmer
@chandrarsrikant You won't get it. Stick to writing paid puff pieces about startups. 🤣 Leave political beat to real journalists.
English

@joeyousss Tempeh, best of both tofu & paneer.
In 200gm ~40-45 gm protein with 18-20gm fibre
English
Ajay Maurya retweetledi

As everything slowly begins to sink-in, and after finally getting some sleep last night, I wanted to share a small personal note…✍️
The first call I made after Vikram-1 successfully reached orbit was to my Dad.
He is the man who made my journey possible—with dreams for me far bigger than the ones I had for myself, and by simply never giving up on me.
Until my 8th standard, I was a bad student. I scored 51 marks in Maths and even failed another subject. Back then, I could never have imagined that I would one day make it to an IIT—or have the privilege of contributing to India’s first privately developed rocket reaching orbit, making India only the third country in the world to achieve this.
When I called him after the launch, he just cried.
And cried.
He couldn’t speak a single word.
But I understood every word he couldn’t say.
I managed to hold back my tears when Vikram-1 reached orbit. But somehow, writing this, I can’t.
Thank you, Dad. ❤️
And a big shout-out to every dad who dreams big for their children—and never gives up on them. 🙏
P.S. A picture with Dad from one of my birthdays after starting @SkyrootA.

English
Ajay Maurya retweetledi

We’ll be watching this ignition on loop all day.
Kalam-1200 — Vikram-1's first stage, named for Dr. A.P.J. Abdul Kalam — roaring to life and lifting Vikram-1 off the pad, on a flight that reached orbit.
#Vikram1 #MissionAagaman
English
Ajay Maurya retweetledi


Cancel it from perplexity website, I had done successfully.

Vineeth K@DealsDhamaka
Airtel Perplexity renewals will come up this week There is no easy option to cancel the subscription. I am worried that’s 1000s of Airtel users will be changed now. Has anyone been able to delete the subscription ? #Perplexity
English

Aap Gatekeeper ho kya ?
Meri society me vacancy hai.
aa-yushi@probablyaayushi
definitely gatekeeping this space.
English
Ajay Maurya retweetledi

Keeping up with AI news is becoming a full-time job.
So my friend @ivan_bezdomny built HuggingNews, an AI-curated feed that surfaces the news actually worth reading. Soon, it will even personalize the feed using your Hugging Face profile. Been using it for weeks!
Bookmark it, or ask your agent to send you the top 10 stories every morning or night. Less noise. More signal. More building!
huggingnews.com

English
Ajay Maurya retweetledi

The data we store on S3 is replicated multiple times to make sure it is never lost (even in the event of a disaster). If they simply stored multiple copies of the data, it would get expensive very quickly at the exabyte scale.
This is where erasure coding gives you the same durability for a fraction of the storage cost. Let me explain...
The idea is simple: split your data into k chunks, then compute m extra parity chunks from them, for a total of n = k + m chunks spread across different disks or nodes. You can lose any m of those n chunks and still reconstruct the original data.
Standard storage class of S3 uses an erasure coding scheme, around 9 data shards and 4 parity shards, spread across multiple availability zones. That gives 99.999999999 percent (eleven nines) durability while using roughly 1.5x the actual data size.
This would have been 3x for a naive triple replication, and thus, the additional cost is pretty low with erasure coding.
The parity math comes from Reed-Solomon codes, the same technique used in QR codes. Given any k of the n total chunks, you can solve a system of linear equations to recover the rest. You can read the Reed-Solomon wiki page for more details, or ask your fav LLM.
By the way, here, the tradeoff is compute.
Reconstructing missing chunks needs CPU cycles to run the decoding math, while replication just reads a copy. Reconstruction also gets slower as you increase the number of parity shards, since the math involves larger matrices.
This is why systems tune k and m carefully. Too few parity shards and durability suffers; too many and reconstruction becomes more expensive.
By the way, Erasure Coding is the reason cloud storage is both cheap and durable at the same time. Just a bunch of encoding math at play.
Hope you found this interesting.
English







