Kubernetes traffic isn't automatically secure.
Pods, services, and cluster components can expose sensitive data if left unencrypted.
Here, @caesar_sage goes over how Kubernetes traffic encryption works & how to use cert-manager automate certificate management.
https://t.co/fBv1OnJvbL
I've been building BlazeRPC — an open-source Python library that lets you serve ML models over gRPC with minimal setup. Think FastAPI, but for gRPC.
It handles proto file generation, adaptive batching, streaming, dependency injection, health checks & more. Works with PyTorch, TensorFlow, and ONNX out of the box.
⭐ Star it, contribute, or just check it out. Feedback and bug reports are very welcome!
GitHub: https://t.co/NigWRRKFQl
Docs: https://t.co/us79SIecY3
You may have heard about OpenClaw – the most viral open source project of the year.
It's an agent and messaging gateway that lets you automate digital tasks through platforms like Discord.
In this course, you'll learn how it works along with key security practices like using Docker-based sandboxing to protect your host system while your agent executes complex workflows.
https://t.co/2YZSAgPRUN
8+ years experience + unemployed + 40 hours a week for a bootcamp? 😭
In this economy? The opportunity cost alone is insane. Lol. Even me that is doing two masters degrees at the same time doesn’t spend 40 hours per week on school. This is a lot!
@TosinOlugbenga I think most of you forgot to read this part "Just resigned if it's too small ...".
Because the lazy or "I don't care" behavior towards work is annoying. Why will you be reminded everytime that there is a standup or meeting that is even in your calendar. Very bad behavior
Docker is a tool you'll likely work with often as a dev.
And whether you're containerizing an app or optimizing workflows, there are certain key concepts to know.
In this guide, @caesar_sage explains build context, features, and architecture along with common issues and fixes.
https://t.co/znzcLOEL5S
WE’VE RAISED 16M! #SaveTinaFromCancer
Tears in my eyes as I type this, I came out with fear and it was my last resort and only thing in my mind was to save my mum, but I couldn’t do with out you guys, my family, friends, tweeps who help rt and even donate, May the Lord bless you all abundantly!
Special thanks to 2nd Corinthians 8-Charitable Foundation who gave in 7M! Thank you so much everyone!
Below are all receipts from all money gathered from Naira to dollar and amount spent and what’s left.
Total
Naira: N16,118,695
Dollar: $621
Topological Sort (Kahn's Algorithm):
Count incoming edges (in-degree) for each task
Queue all tasks with in-degree = 0
Process queue, reducing neighbors' in-degrees
Add neighbors to queue when in-degree hits 0
Gives valid execution order + validates no cycles exist.
(6/8)
Lessons learned:
- Prevent cycles at construction time
- Runtime status > graph structure for determining readiness
- Dual data structures = query efficiency
- Continuous polling enables max parallelism
Building distributed systems from first principles is
Key challenge: Preventing cycles
A → B → C → A would create an infinite loop.
Solution: Validate BEFORE adding each dependency using DFS.
If adding X → Y would create a path back to X, reject it.
Cycles prevented at build time, not runtime.
(5/8)
Thread: Building a workflow engine from scratch 🧵
I'm building a workflow engine that executes tasks in parallel while respecting dependencies. Here's how I used DAGs (Directed Acyclic Graphs) to make it work.
(1/8)
code: https://t.co/No8kYSTIge
Example execution flow:
Initial: [A] ready (no deps)
After A: [B, C] ready → run in parallel! 🚀
After B & C: [D] ready
After D: Done
The engine continuously discovers what can run next.
(4/8)
The core problem:
How do you know which tasks are ready to execute?
Answer: A task is ready when ALL its dependencies have completed successfully.
This changes dynamically as tasks finish.
(3/8)
What's a DAG?
A graph where edges have direction and no cycles exist.
Think: Task A → B means "B depends on A"
Example:
Task A, [B, C] and D
A runs first, B & C run in parallel, D runs last.
(2/8)