r33drichards

AWS Cost Analysis Report - Cua AI

Account: 296062593712 (Cua AI - Organization Master) Organization: o-0ouf7arrd4 Report Date: January 20, 2026 Prepared by: Automated AWS Cost Analysis

---

🚨 EXECUTIVE SUMMARY - CRITICAL FINDING

r33drichards

AWS Cost Analysis Report

Account: 2960-6259-3712 | Region: us-west-2 | Report Date: January 20, 2026

---

Executive Summary

Metric	Value	Change
Month-to-Date Cost	$19,723.62	↑ 26% vs same period last month

r33drichards

Creating Amazon AMIs from a NixOS Flake

This gist documents the essential logic for building Amazon AMIs using Nix flakes and nixos-generators.

Overview

The approach uses:

• nixos-generators - Community tool for generating NixOS images in various formats
• Nix flakes - For reproducible, declarative configuration
• Comin - GitOps-style automatic configuration updates

r33drichards

{
  system ? builtins.currentSystem,
  config ? { },
  pkgs ? import ../../.. { inherit system config; },
  lts ? true,
  ...
}:
let
  incusTest = import ./incus-tests.nix;
in

r33drichards

Container Registry Proxy for CUA Cloud

This feature adds a Docker Registry API v2 proxy to the CUA Cloud API, allowing users to push Docker images through the API with automatic workspace-based namespacing.

What It Does

• Authenticates image pushes using workspace API keys (same keys used for the REST API)
• Automatically namespaces images by workspace slug (e.g., myimage:latest → {workspace_slug}/myimage:latest)
• Proxies requests to an internal Docker registry, keeping the registry private

r33drichards

cua-bench Benchmark API

Run agents against CUA environments without conforming to the BaseAgent class.

Usage

# Run locally (Docker + QEMU for Windows)
cb run windows_agent.py

r33drichards

CUA-Bench Architecture Guide

A comprehensive guide to understanding the CUA-Bench codebase, focusing on benchmark launching and Docker container execution.

Table of Contents

1. Overview
2. Project Structure
3. High-Level Architecture
4. CLI Command Flow

r33drichards

<!-- wp:image {"id":69,"sizeSlug":"large","linkDestination":"none"} -->
<figure class="wp-block-image size-large"><img src="https://wordpress-sm7xo.wasmer.app/wp-content/uploads/2025/12/image-768x1024.png" alt="" class="wp-image-69"/></figure>
<!-- /wp:image -->

<!-- wp:paragraph -->
<p>On a snowy day at my parents' house, I was passing time with family and reading a blog post about <a href="https://www.hillelwayne.com/post/picat/">planner programming</a> when my grandmother invited me to play Othello at her apartment. While getting the game out of her cabinet, I noticed a box for <a href="https://en.wikipedia.org/wiki/Peg_solitaire">Hi-Q</a>. I owned this game as a child and had played it to the point where I could reliably win with one peg left every time. To my disappointment, I could only get down to 4 pegs when I tried again now. While my Hi-Q skills had atrophied, my programming skills have improved considerably—I wondered if I could find an optimal solution using <a href="http://picat-lang.org/">Picat

r33drichards

Solving Hi-Q (Peg Solitaire) with Deep Learning

On a snowy day at my parents' house, I was passing time with family and reading a blog post about planner programming when my grandmother invited me to play Othello at her apartment. While getting the game out of her cabinet, I noticed a box for Hi-Q. I owned this game as a child and had played it to the point where I could reliably win with one peg left every time. To my disappointment, I could only get down to 4 pegs when I tried again now. While my Hi-Q skills had atrophied, my programming skills have improved considerably—I wondered if I could find an optimal solution using Picat. I couldn't. But I did find a way to solve it with deep learning.

Attempt 1: Constraint-Based Approaches

I installed Picat and vibe-coded some scripts to find a se

r33drichards

<!-- wp:image {"id":69,"sizeSlug":"large","linkDestination":"none"} -->
<figure class="wp-block-image size-large"><img src="https://wordpress-sm7xo.wasmer.app/wp-content/uploads/2025/12/image-768x1024.png" alt="" class="wp-image-69"/></figure>
<!-- /wp:image -->

<!-- wp:paragraph -->
<p>On a snowy day at my parents' house, I was passing time with family and reading a blog post about <a href="https://www.hillelwayne.com/post/picat/">planner programming</a> when my grandmother invited me to play Othello at her apartment. While getting the game out of her cabinet, I noticed a box for <a href="https://en.wikipedia.org/wiki/Peg_solitaire">Hi-Q</a>. I owned this game as a child and had played it to the point where I could reliably win with one peg left every time. To my disappointment, I could only get down to 4 pegs when I tried again now. While my Hi-Q skills had atrophied, my programming skills have improved considerably—I wondered if I could find an optimal solution using <a href="https://picat.dpac.mil/">Pica