Skip to content

Instantly share code, notes, and snippets.

View Hulupeep's full-sized avatar
🏠
Working from home

Colm Hulupeep

🏠
Working from home
  • ireland
View GitHub Profile
@Hulupeep
Hulupeep / gist.md
Created July 10, 2026 02:05
CCF Sinkhorn-Knopp presentation cost: iteration count vs matrix density, gauge/presentation not causal trust, real Rust benchmarks 5/10/20/50 iters, Prov6 posture

CCF 2026: Sinkhorn-Knopp Presentation Cost Tracks Matrix Density, Not a Fixed Iteration Count

Sinkhorn-Knopp doubly-stochastic normalization at a fixed iteration count wastes compute on dense matrices and under-serves sparse ones, measured directly.

Introduction

Sinkhorn-Knopp (SK) is the standard way to push a matrix of positive numbers toward doubly stochastic: alternately normalize every row, then every column, and repeat. It shows up across manifold-constrained hyper-connections (mHC, arXiv:2512.24880) and other neural-network mixing schemes as a fixed 20-iteration budget. This gist measures what that fixed budget actually buys, at 5/10/20/50 iterations, on two synthetic matrix regimes chosen to sit on either side of the density phase transition He (arXiv:2507.09711) identifies for Sinkhorn-Knopp convergence. In CCF, SK-style normalization is used only as a gauge/presentation step, never as the causal trust-transfer update itself, which is a separate quotient-affine contraction (QAC) step. This

@Hulupeep
Hulupeep / gist.md
Created June 18, 2026 02:13
Runtime trust certificate floor: a per-step dynamic finite-precision threshold for autonomous-agent trust verification — separating real loss-of-contraction signals from machine rounding noise. CCF Prov6, Rust benchmarks (f64/f32/fixed-point), no universal threshold.

CCF 2026: The Runtime Trust Certificate Floor — Telling a Real Signal From Rounding Noise in Autonomous-Agent Trust Verification

A runtime trust certificate floor for autonomous agents: a per-step, dynamic finite-precision threshold that separates a real loss-of-contraction signal from machine rounding noise. Real Rust benchmarks across f64/f32/fixed-point.

Introduction

Every runtime trust certificate for an autonomous agent eventually runs into arithmetic. As a trust value homes in on its target, the per-step change shrinks — until it's smaller than the rounding error of the computer making the change. At that point the residual you measure is noise, not signal. Hard-code a single

@Hulupeep
Hulupeep / gist.md
Created June 17, 2026 14:34
CCF 2026: elder care robot trust geometric — geometric action gating with a runtime trust certificate that cannot over-trust a confused person. Hard min-gate, log-geodesic QAC update, per-step residual certificate, fail-closed. Rust PoC, real benchmarks.

CCF 2026: Elder Care Robot Trust — Geometric Action Gating That Cannot Over-Trust a Confused Person

A care robot must do less exactly when an elder is most vulnerable. CCF derives action authority from a geometric trust gate with a runtime certificate — and proves zero over-trust in simulation.

Introduction

Elder care robot trust is the safety problem nobody likes to name: a socially assistive robot that keeps acting on a stale, optimistic relationship estimate even as the person it serves becomes confused, distressed, or unable to consent. Reviews of social robots for people living with dementia keep flagging the same

@Hulupeep
Hulupeep / GIST_CONTENT.md
Created September 1, 2025 06:55
Palestine in 100 Objects - Investigative chronicle examining Palestinian experience through material culture

Palestine in 100 Objects - Project Overview

An investigative chronicle examining Palestinian experience through 100 carefully researched objects, tracing supply chains from point of impact to corporate boardrooms and investment portfolios.

📚 Repository

https://github.com/Hulupeep/palestine-100-objects

📊 Project Scale

  • 100 objects documented
  • ~120,000 words (400-500 pages)