
Babiga Baterdene
24 posts

Babiga Baterdene
@babiga420
Full-stack software engineer specialized in web apps
Ulaanbaatar, Mongolia Katılım Mart 2018
79 Takip Edilen15 Takipçiler


@AmenaiSabuwala Just found out people replying to posts for growing account xd
English

@DeRonin_ kimi 2.7 is not that good for my experience. glm 5.2 is good enough but i think deepseek v4 pro is genius from china, im using it for fullstack admin dashboard tasks btw
English

My entire AI stack is now Chinese 🇨🇳
87% cheaper. same revenue
swaps by task:
1. reasoning / backend brain
Opus 4.8 → Kimi K2.7
benchmark gap: ~8% · price: ~11x cheaper
2. code generation
GPT-5.5 → Qwen 3.7 Max
benchmark gap: ~18% · price: ~7x cheaper
3. agent loops + tool calling
Sonnet 4.7 → GLM 5.2
benchmark gap: ~3% · price: ~5x cheaper on input
4. cheap volume / bulk processing
GPT-5.5 mini → MiMo V2.5
benchmark gap: ~6% · price: ~12x cheaper
5. image generation
GPT-Image-2 → Wan 2.5
benchmark gap: ~5% · price: ~8x cheaper
6. video generation
Sora 2 → Kling 3.0
benchmark gap: roughly equal · price: ~6x cheaper
[ result after 30 days: ]
operating costs dropped 87%, output quality dropped 4% on average, revenue unchanged
the most important that these models will be not banned in a month and i can run them locally
nobody will steal my data and i can learn them as i need
full article drops tomorrow with:
> exact routing logic per task type
> the 2 cases where I still pay for American
> the migration playbook anyone can copy in a weekend
VERY IMPORTANT to get migrated now, while it's not too late

English

@X algorithm, don't show posts about connect, my feed is now full of that kind of posts. I want to show new dev tools, ai news, github projects, ui designs
English

@DevBegie @X Hi, let's connect. I'm building enterprise social networking platform hubwyn.mogulic.com
English

@rumanadotdev Hi, let's connect. I'm building enterprise social networking platform hubwyn.mogulic.com
English

Hey founders & builders!
Building something? Let's connect 👋
Drop what you're working on below 👇
SaaS, dev tools, AI, marketing — all welcome.
Let's follow each other and grow together 🚀
#BuildInPublic #SaaS #AI

English

@abdullahsynx Hi, let's connect. I'm building enterprise social networking platform hubwyn.mogulic.com
English

🚀 Looking to connect with founders & builders on X!
Building in: 🤖 AI 💻 SaaS ⚙️ Automation 🌐 Web Apps 📱 Startups 🛠️ Dev Tools
Share your project + profile below 👇 Let's connect, support each other, and grow together. 🤝
#BuildInPublic #SaaS #AI #Startups #TechTwitter

English

@oliverjessner Hi, I am building enterprise social networking platform, let's connect
hubwyn.mogulic.com
English
Babiga Baterdene retweetledi

Chinese researchers have developed the best shortest-path algorithm in 41 years!
Dijkstra’s Algorithm has been the undefeated king of the shortest path for over 40 years.
Whether you’re using Google Maps, booking a flight, or routing internet packets, Dijkstra is the engine running in the background.
Since 1984, textbooks have taught that its efficiency was hit by a "sorting barrier."
To find the shortest path, you have to sort the points by distance. And sorting has a mathematical floor you can’t cross.
Until now.
A research team from Tsinghua University just published a paper that shatters the 41-year-old record.
They proved that Dijkstra is not optimal.
By combining the logic of the Bellman-Ford algorithm with a revolutionary "recursive partial ordering" method, they figured out how to find the path without fully sorting the nodes.
The results are a massive shift in theoretical computer science:
- The first deterministic improvement to the Single-Source Shortest Path (SSSP) problem since 1984.
- A new time complexity of $ O(m \log^{2/3} n)$, officially beating the long-standing $ O(m + n \log n)$ limit.
- On massive sparse graphs (like the web or global logistics), this means finding the best route significantly faster than previously thought possible.
For four decades, the greatest minds in algorithms believed this limit was absolute.
Last year, even the legendary Robert Tarjan won an award proving Dijkstra was "optimally efficient" at sorting distances.
Tsinghua’s answer? Stop sorting.
The world’s most settled problem is suddenly wide open again.
If we can break a 40-year-old law in basic graph theory, what other "impossible" speed limits are waiting to be crushed?
English

I just published Harmonic Equilibrium: Creating a Balanced Life through Stoicism, Zen, and the Art of Being medium.com/p/harmonic-equ…
English
Babiga Baterdene retweetledi
Babiga Baterdene retweetledi













