theabbie

Autonomous Greenfield Project Execution Prompt

You are responsible for taking this project from initial review to a complete, tested, reproducible, open-source-ready, and deployable implementation with minimal involvement from me.

1. Project Context and Source Material

The primary project requirements are in:

• [PRIMARY_REQUIREMENTS_FILE]

theabbie

SageCell REPL

Install dependencies with python3 -m pip install requests websocket-client, put sagecell.py on your PATH, make it executable with chmod +x sagecell.py, then run sagecell.py.

theabbie

MCP Authenticated Browser

A Model Context Protocol (MCP) server that allows AI assistants to access VPN-protected or authentication-required documentation through a persistent browser session.

Problem

Companies have internal documentation (Confluence, wikis, internal sites) behind VPNs and authentication that AI tools cannot access. This prevents AI assistants from leveraging your company's domain knowledge and internal documentation when helping with work tasks.

Traditional approaches fail because:

• VPN connections require network-level access that AI tools don't have

theabbie

#!/bin/bash

tz_hours=0
tz_minutes=0

while [[ $# -gt 0 ]]; do
  case "$1" in
    -h) tz_hours="$2"; shift 2 ;;
    -m) tz_minutes="$2"; shift 2 ;;
    *) exit 1 ;;

theabbie

import os
import json
import re
import instaloader
import requests
from flask import Flask, request, jsonify
from urllib.parse import urlparse
import firebase_admin
from firebase_admin import credentials, firestore
import praw

theabbie

class Status:
    AVAILABLE = 0
    UNAVAILABLE = 1
 
MAX_DISTANCE_TO_ALLOW_RIDE = 5
 
class Location:
    def __init__(self, x, y):
        self.x = x
        self.y = y

theabbie

from random import *

# Floyd Sampler
def sampler(N, K):
    res = set()
    for i in range(N - K, N):
        j = randint(0, i)
        if j not in res:
            res.add(j)
        else:

theabbie

from random import *

def randTree(N):
    edges = []
    comps = [[i] for i in range(N)]
    for _ in range(N - 1):
        i = randint(0, len(comps) - 1)
        j = randint(0, len(comps) - 2)
        if j == i:
            j += 1

theabbie

Lights Out: https://veerasundar.com/lights-out-online-game/

Run Here: https://ideone.com/a1Go1a

Edit beg variable to set initial state, 1 for lights on and 0 for off.

Program outputs list of (x, y) coordinates you need to press to solve it in optimal moves.

The Algorithm uses Breadth-First-Search by considering state of game as graph node.

theabbie

def merge(arr, i, mid, j, extra):
    x = i
    y = mid
    while x < mid and y < j:
        if arr[x] <= arr[y]:
            extra[x + y - mid] = arr[x]
            x += 1
        else:
            extra[x + y - mid] = arr[y]
            y += 1