Skip to content

Instantly share code, notes, and snippets.

View egorsmkv's full-sized avatar
🌍
world, hello

Yehor Smoliakov egorsmkv

🌍
world, hello
View GitHub Profile

Architecture for Autonomous Software Development with Ambidextrous AI Agents

Purpose

This architecture defines an autonomous software development system that can take bounded engineering work from request intake to reviewed pull request while balancing two operating modes:

  • Right Hand / Exploitation: reliable production execution using known workflows, strict gates, and minimal-risk changes.
  • Left Hand / Exploration: sandboxed discovery of better solutions, tools, prompts, tests, and architectural alternatives.

The system should behave like a disciplined engineering team: inspect the code, plan the work, make scoped changes, validate them, explain the result, and escalate when uncertainty or risk is high.

@egorsmkv
egorsmkv / adaptive-capability-architecture.md
Created April 23, 2026 19:50
adaptive capability architecture

Adaptive Capability Architecture

Adaptive Capability Architecture is a pragmatic successor to Clean Architecture. It keeps Clean Architecture's useful core: dependency inversion, testable business logic, and framework independence. It improves the model by making the primary unit of design a business capability that is owned, observable, enforceable, and safe to evolve.

Clean Architecture asks:

import torch
import torch.nn as nn
import torch.nn.functional as F
# -----------------------------------------------------------------------------
# HiF4 reference implementation
# Paper assumptions used here:
# - 1 HiF4 block = 64 values
# - metadata = 1x E6M2 + 8x E1_8 + 16x E1_16
#include "utf8.h"
#include <stdlib.h>
size_t utf8_decode_advance(const char8_t *bytes, size_t len,
uint32_t *out_codepoint, bool *out_invalid) {
if (!bytes || len == 0)
return 0;
uint8_t b0 = bytes[0];
uint32_t codepoint = 0xFFFD;
#include <stdint.h>
#include <stdbool.h>
#include <stdlib.h>
#include <stdio.h>
#include <math.h>
#include <string.h>
#include <time.h>
/**
* SPANN High-Performance Memory-Disk Hybrid Search
// Compile with:
// clang -O3 -march=znver4 -fopenmp -ffast-math -mavx512f -mavx512dq amd_zen_matrix.c -o amd_zen_matrix
// Note: Use -march=znver5 if available in your compiler (GCC 14+ / Clang 18+).
// If not, -march=znver4 is safe and highly effective for Ryzen 9000.
#include <stdio.h>
#include <stdlib.h>
#include <stdint.h>
#include <stdbool.h>
#include <time.h>
import math
from typing import Dict, Set, Tuple, Optional, List
from collections import defaultdict
# Type Aliases for code clarity and PEP 484 compliance
PointID = int
Coordinates = Tuple[float, ...]
class Point:
"""
use std::collections::HashMap;
use std::marker::PhantomData;
use std::sync::Arc;
use std::sync::Mutex;
/// ======== TYPES ========
type UserId = String;
/// ======== STRUCTS, ENUMS ========
@egorsmkv
egorsmkv / calc_alloc.rs
Created August 4, 2025 11:01
Rust Stack and Heap Size Demonstration
// This program demonstrates how to get a rough estimate of stack usage
// and how to track heap allocations in Rust.
//
// NOTE: This approach for stack measurement is not reliable or portable.
// It is for demonstration purposes only. The heap tracking method is a
// more robust way to monitor memory usage.
use std::alloc::{GlobalAlloc, Layout, System};
use std::sync::atomic::{AtomicUsize, Ordering};
@egorsmkv
egorsmkv / logs.txt
Created July 30, 2025 17:56
decoding frames: logs of read-video-rs run
[swscaler @ 0x120008000] No accelerated colorspace conversion found from yuv420p to rgb24.
best_video_stream_index: 0
Width: 1920, height: 1080
Duration: 494.30734451395824 seconds
FPS: 30.001577377319336
Successfully sought to frame near index 0.
Frame time: 0
Successfully sought to frame near index 30.
Frame time: 8.332895221071446
Successfully sought to frame near index 60.