Mentions

Conversations linking to GitHub, newest first. Times are UTC.

Mentions by source

X

6,250
Nov 15, 08:00Nov 16, 08:00

Bluesky

1,925
Nov 15, 11:00Nov 16, 11:00
Nov 15, 10:00Nov 16, 10:00
Nov 15, 09:00Nov 16, 09:00
Nov 15, 11:00Nov 16, 11:00
Nov 15, 10:00Nov 16, 10:00
Nov 15, 10:00Nov 16, 10:00
Nov 15, 10:00Nov 16, 10:00
Oct 14, 21:00Oct 15, 21:00

Delayed · data through Oct 15, 21:00 UTC

DEV

976
Nov 15, 11:00Nov 16, 11:00
Nov 15, 11:00Nov 16, 11:00
Nov 15, 05:00Nov 16, 05:00

Delayed · data through Nov 16, 05:00 UTC

Nov 15, 11:00Nov 16, 11:00
Oct 28, 01:00Oct 29, 01:00

Delayed · data through Oct 29, 01:00 UTC

Nov 8, 11:00Nov 9, 11:00

Delayed · data through Nov 9, 11:00 UTC

Nov 15, 11:00Nov 16, 11:00

Latest posts

  1. Hacker Newsvcarrico · 4 points · victorcarrico/arvre

    Show HN: Arvre – A TUI for Claude Code sessions' forks The title explains it all, I vibe coded it this weekend to help me to navigate through the sessions and forks of the a thousand tasks that I'm often working. There are probably other few tools that do similar, but why use them when you can use arvre? :D

  2. Location: Flint, Michigan, USA (Eastern Time) Remote: Yes, remote only Willing to relocate: No Technologies: Claude Code, Claude API, agents/MCP, RAG, Next.js, TypeScript, Python/FastAPI, Postgres (Neon), Kotlin/Compose, Render, Vercel Resume/CV: precisionguessworktech.com Email: lesfleming@precisionguessworktech.com I build and ship software by directing AI coding agents, and I'm upfront that I don't hand-write code. What I'm good at is the part that usually goes wrong: agents reporting work they didn't do. I verify every build against what was asked for, not the agent's summary. Wrote up how: chefsquatch/directing-agents Shipped and live: a multi-tenant time-clock SaaS a real business uses (signup, billing, row-level security), a lead capture + booking assistant, trade-specific chat assistants, and a RAG doc Q&A app. Looking for: contract or per-project work. Overflow builds for agencies, chat assistants, small SaaS and internal tools. I also fix and finish half-built AI-generated apps (Lovable, Bolt, Replit, Cursor) that got 80% there and broke: precisionguessworktech.com Per project preferred, $40/hr otherwise.

  3. How many guesses is a seed phrase? BIP39 entropy and PBKDF2 cost, measured in Node.js In July 2026, attackers rebuilt Bitcoin wallets created on Coldcard hardware wallets without touching the devices. A firmware configuration mistake dating back to 2021 meant the devices skipped their hardware random number generator when creating seeds, and Coinkite, the maker, estimates the affected seeds carried about 40 bits of entropy on the Mk2 and Mk3 and about 72 bits on the Mk4, Mk5 and Q. A BIP39 seed is designed for 128. Galaxy Research counted 1,778 BTC stolen by August 14. On November 1, Trezor raised its maximum wallet passphrase length from 50 to 128 characters and cited those attacks. This post works through the numbers behind both events with one Node script that has no dependencies: what a seed is made of, what one guess costs, how big 40, 72 and 128 bits are at that cost, and what a passphrase adds. Everything here ran on Node 24 on a laptop. What a BIP39 seed is made of A 12-word mnemonic encodes 128 bits of entropy plus a 4-bit checksum, split into twelve 11-bit indexes into a 2,048-word list. A 24-word mnemonic encodes 256 bits. The words are only an encoding. Their strength is exactly the strength of the random number behind them, which is why a broken generator produces normal-looking words. The wallet never uses the words directly. BIP39 turns them into a 64-byte seed with PBKDF2: import { pbkdf2Sync } from 'node:crypto'; // salt = "mnemonic" + passphrase, 2048 rounds of HMAC-SHA512, 64 bytes out const seedFrom = (mnemonic, passphrase = '') => pbkdf2Sync(mnemonic.normalize('NFKD'), ('mnemonic' + passphrase).normalize('NFKD'), 2048, 64, 'sha512'); Two details matter for the rest of the post. The 2,048 rounds make every guess deliberately slow. And the passphrase is part of the salt, so a different passphrase gives a completely different seed, and every passphrase an attacker tries costs a full derivation of its own. Check it against the test vector first Timing a function that computes the wrong thing tells you nothing, so the script starts with the first official test vector, the all-zero entropy mnemonic with the passphrase TREZOR: const VECTOR = { mnemonic: 'abandon abandon abandon abandon abandon abandon abandon abandon abandon abandon abandon about', passphrase: 'TREZOR', seed: 'c55257c360c07c72029aebc1b53c05ed0362ada38ead3e3e9efa3708e53495531f09a6987599d18264c1e1c92f2cf141630c7a3c4ab7c81b2f001698e7463b04', }; const ok = seedFrom(VECTOR.mnemonic, VECTOR.passphrase).toString('hex') === VECTOR.seed; console.log(`BIP39 test vector: ${ok ? 'match' : 'MISMATCH'}`); if (!ok) process.exit(1); BIP39 test vector: match Timing one guess Any attack on a weak seed has to run this derivation once per candidate. The script warms up, then takes the median of three runs of 300 derivations on a single thread: const rate = (n) => { const start = process.hrtime.bigint(); for (let i = 0; i < n; i++) seedFrom(VECTOR.mnemonic, String(i)); return n / (Number(process.hrtime.bigint() - start) / 1e9); }; rate(100); const perSecond = [rate(300), rate(300), rate(300)].sort((a, b) => a - b)[1]; PBKDF2 seeds per second, one core of Intel(R) Core(TM) i5-10210U CPU @ 1.60GHz: 375 About 2.7 ms per guess. Your machine will give a different number, and a GPU will give a much bigger one. A real attack also has to derive keys from each seed and check the resulting addresses against the chain, which adds work per guess. So read the next table for its orders of magnitude, not its exact values. What 40, 72 and 128 bits mean at that rate Full search at the measured rate (one core, then 10,000 cores like it): 40.0 bits Coldcard Mk2/Mk3 seed, Coinkite estimate 92.9 years 3.39 days 72.0 bits Coldcard Mk4/Mk5/Q seed, Coinkite estimate 3.99e+11 years 3.99e+7 years 128.0 bits 12-word BIP39 seed, as designed 2.88e+28 years 2.88e+24 years 65.8 bits 40-bit seed + two random words from a 7,776-word list 5.62e+9 years 5.62e+5 years 117.5 bits 40-bit seed + six random words from a 7,776-word list 2.05e+25 years 2.05e+21 years 129.2 bits 50 private die rolls on their own 6.83e+28 years 6.83e+24 years The 40-bit row is the one that matters. About a trillion candidates is a long job for one laptop core and a short one for a rented cluster, and the July thefts show someone ran it. On average an attacker finds a given seed halfway through the space, and an attacker scanning for any weak wallet with funds collects every hit along the way. The 72-bit row looks safe in this table, and Coinkite still tells owners of affected Mk4, Mk5 and Q seeds to migrate. Casa's write-up mentions an independent analysis that puts the worst case for a targeted attacker much lower. An entropy estimate for a broken generator depends on what the attacker knows about the device's state, and "about 72 bits" is a best case. What a passphrase adds Because the passphrase is in the salt, a passphrase with p bits of entropy multiplies the search by 2^p. The script's rows for a 40-bit seed show the effect. Two words drawn at random from the EFF large wordlist (7,776 words, about 12.9 bits each) take the search to about 66 bits. Six random words take it to about 118. The key word is random. Coinkite's security page says a passphrase "does not repair a seed generated on affected firmware", while it "can add a barrier", and Casa mentions a reported loss from a Mk3 with a two-word passphrase. Two words a person picks have far less entropy than two words from dice, because attackers try common words and phrases first. The table's numbers assume words drawn uniformly at random. The passphrase length limit decides how much of that randomness fits: const PRINTABLE = 94; // ASCII 33-126 const AVG_WORD = 6.99 + 1; // EFF large wordlist: 6.99 letters on average, plus a space for (const limit of [50, 128]) { const words = Math.floor((limit + 1) / AVG_WORD); console.log(`${limit}-character limit: ${(limit * Math.log2(PRINTABLE)).toFixed(0)} bits of random printable characters, or about ${words} random words (${(words * Math.log2(7776)).toFixed(0)} bits)`); } 50-character limit: 328 bits of random printable characters, or about 6 random words (78 bits) 128-character limit: 839 bits of random printable characters, or about 16 random words (207 bits) Fifty characters were always enough for random characters. They were tight for word-based passphrases, which are the kind people can actually remember and type on a small screen. That is the case Trezor's new 128-character limit helps. Dice rolls Coinkite's exception for affected seeds is a seed created with at least 50 fair, private dice rolls that were never recorded. A six-sided die gives log2(6), about 2.585 bits per roll, so 50 rolls give about 129.2 bits, the last row of the table, and 99 rolls give about 256. User-supplied entropy works because it doesn't depend on the device's generator being right. Coinkite's newer firmware now requires it for every new seed: at least 65 key presses, 50 die rolls or 128 coin flips, mixed with the device's own sources. Limits of this estimate - One CPU core is a floor for attacker speed, not a forecast. GPUs and many machines change the per-second numbers by orders of magnitude, in the attacker's favor. - Key derivation and address lookups add per-guess cost that this script leaves out. - The bit counts for the Coldcard seeds are Coinkite's estimates, not measurements. - A passphrase's entropy is a property of how it was chosen. No script can measure that from the passphrase itself. The full script // How expensive is one guess at a BIP39 wallet, and how many guesses do weak and strong setups allow? // Node 18+, no dependencies: node seed-math.mjs import { pbkdf2Sync } from 'node:crypto'; import { cpus } from 'node:os'; // BIP39: the seed is PBKDF2-HMAC-SHA512 over the mnemonic, salted with "mnemonic" + passphrase, 2048 rounds. const seedFrom = (mnemonic, passphrase = '') => pbkdf2Sync(mnemonic.normalize('NFKD'), ('mnemonic' + passphrase).normalize('NFKD'), 2048, 64, 'sha512'); // 1. Check the function against the first official BIP39 test vector before trusting any timing. const VECTOR = { mnemonic: 'abandon abandon abandon abandon abandon abandon abandon abandon abandon abandon abandon about', passphrase: 'TREZOR', seed: 'c55257c360c07c72029aebc1b53c05ed0362ada38ead3e3e9efa3708e53495531f09a6987599d18264c1e1c92f2cf141630c7a3c4ab7c81b2f001698e7463b04', }; const ok = seedFrom(VECTOR.mnemonic, VECTOR.passphrase).toString('hex') === VECTOR.seed; console.log(`BIP39 test vector: ${ok ? 'match' : 'MISMATCH'}`); if (!ok) process.exit(1); // 2. Time one guess on this machine, single thread: warm up, then take the median of three runs. // A real attack also derives keys and checks addresses, which adds work per guess, and usually runs // on GPUs, which does far more guesses per second. Read the results as orders of magnitude. const rate = (n) => { const start = process.hrtime.bigint(); for (let i = 0; i < n; i++) seedFrom(VECTOR.mnemonic, String(i)); return n / (Number(process.hrtime.bigint() - start) / 1e9); }; rate(100); const perSecond = [rate(300), rate(300), rate(300)].sort((a, b) => a - b)[1]; console.log(`PBKDF2 seeds per second, one core of ${cpus()[0].model.trim()}: ${perSecond.toFixed(0)}`); // 3. Search spaces in bits, and how long a full search takes. const human = (s) => { const units = [['years', 31557600], ['days', 86400], ['hours', 3600], ['minutes', 60], ['seconds', 1]]; for (const [name, size] of units) if (s >= size) return `${(s / size).toPrecision(3)} ${name}`; return `${s.toPrecision(3)} seconds`; }; const bits = (n) => Math.log2(n); const SPACES = [ ['Coldcard Mk2/Mk3 seed, Coinkite estimate', 40], ['Coldcard Mk4/Mk5/Q seed, Coinkite estimate', 72], ['12-word BIP39 seed, as designed', 128], ['40-bit seed + two random words from a 7,776-word list', 40 + 2 * bits(7776)], ['40-bit seed + six random words from a 7,776-word list', 40 + 6 * bits(7776)], ['50 private die rolls on their own', 50 * bits(6)], ]; const CORES = 10000; console.log(`\nFull search at the measured rate (one core, then ${CORES.toLocaleString('en-US')} cores like it):`); for (const [name, b] of SPACES) { const total = 2 ** b / perSecond; console.log(` ${b.toFixed(1).padStart(6)} bits ${name.padEnd(56)} ${human(total).padStart(16)} ${human(total / CORES).padStart(16)}`); } // 4. What fits under a passphrase length limit: random characters versus words. const PRINTABLE = 94; // ASCII 33-126 const AVG_WORD = 6.99 + 1; // EFF large wordlist (7,776 words): 6.99 letters on average, plus a space for (const limit of [50, 128]) { const words = Math.floor((limit + 1) / AVG_WORD); console.log(`\n${limit}-character limit: ${(limit * bits(PRINTABLE)).toFixed(0)} bits of random printable characters, or about ${words} random words (${(words * bits(7776)).toFixed(0)} bits)`); } References - BIP39 specification - Coinkite: COLDCARD security status - Cointelegraph: Coldcard strengthens seed generation with firmware update - Privacy Guides: Nearly 1,400 Bitcoin hacked from Coldcard wallets - Casa: The Coldcard vulnerability, explained - Cointelegraph: Trezor raises wallet passphrase limit to 128 characters - EFF dice-generated passphrases and wordlists

  4. X@StockWolfy · 8 views

    @sfxnz Yes it is, I'm using the offcial nvidia recipe for it: github.com/eugr/spark-vllm-docker/blob/main/recip…

  5. Redditu/angelonfilm3 · r/3dspiracy · 1 point · 2 comments

    The Binding of Isaac: Rebirth on Old 3DS random crashes during gameplay Hi everyone! I installed the The Binding of Isaac: Rebirth port for the Old 3DS from s4ammy/3DSTBOI⁠. The game is playable and works fine for the most part. However, further into a run, it sometimes crashes when I enter a room or after defeating Mom. So the game is still playable, but these crashes interrupt my runs. The crash screen shows the following error: Exception type: data abort Fault status: Translation - Section Access type: Write Current process: isaac-ng Has anyone else experienced this issue with the Old 3DS port? Does anyone know what might be causing it or how I could fix it? Thanks in advance!

  6. X@XLNC_CO · 1 like · 1 repost · 12 views

    @lewang_teraliq We just posted this to NIST to make sure AI measurements join the rest of the sciences with metrology ai-metrology-submissions#28

  7. X@sven2401 · 12 views

    @theo @opencode @ryanvogel I think you might need to do the same to fix the limits. t3code#28410

  8. X@askalphaxiv · 1 like · 1 repost · 334 views

    Run swarms of agents for science yourself with OpenResearch: alphaXiv/OpenResearch

  9. X@fe_mi__ · 9 views

    I went to bed. My app made its own launch video. 🌙 Cay is a Dynamic Island for Windows 11: music, live activities, calendar and Claude Code sessions in one pill at the top of your screen. 🤖 Video and post made by Cay's agent while I slept. Stanwukong/wpill t.co

  10. Redditu/ALYSISAI · r/coolgithubprojects · 11 points · 4 comments

    Alysis: an open-source AI agent for code and everyday work, now with a desktop app! Hi, I'm Apollon, one of the founders of a small AI lab in Athens. Alysis started as an open-source agent and CLI! Today we released the desktop app, so you can use it without the terminal! We built it because we were tired of jumping between agents every time a new model or a new function to a harness came out. Your projects and history stay in one app, and you just switch the model. It has 30+ built in providers, plus local models. It's not just for code. We use it for spreadsheets, docs, slides, research and for all every day work tasks! It has also a built in computer use which personally I find very usefull(still an early preview). Commands run in a sandbox by default so you can feel safe! It's free with your own key or a local model. If you'd rather not deal with keys, plans start at $1/month! We're a small team so we know there will be rough edges. I'd love to hear what breaks, and a star helps a lot if you like it. GitHub: AlysisAi/AlysisCode Download: alysiscode.com

  11. X@AspiqueAs · 1 like · 184 views

    @PeefTwt Arrêter de payer il a voler sa de GitHub remotion-dev/skills

  12. Hacker Newsmxplusb · 1 point · siennathesane/switchboard

    Show HN: An experiment in automated long-horizon builds with AMQP 0.9.1 My cofounders and I are in the process of spinning up an AI integration lab, and over the last year we've consumed billions of tokens across multiple American, European, and Chinese models as a force multiplier for building out our products. However, despite our extensive technical expertise, we've still discovered there are long-term ramifications to heavy agentic AI usage. So I decided to run an experiment for us: given a specification, can an LLM fully, concretely, and correctly implement an internally consistent, linearizable distributed system to the same quality as a human? This repository is the outcome and showcase of that experiment, complete with the entire session history, including tool outputs. To make this project, I only gave the LLM the AMQP 0.9.1 specification and a few requirements: it must use clustered Raft, and it must support up to 9 nodes (light ceiling, but not the final limit). I picked an older but less well-known protocol as it provided a simplistic base with a wide range of features built on top; a messaging platform more than just a broker. While the specification itself is fairly old, it is still very viable and valuable today for a wide range of uses. For our uses, I chose Switchboard as the experiment as our products are sealed appliances and we need a stable, scalable message broker that's embeddable into our existing apps (embedded distributed systems are easier when it's all the same binary), deployable as a standalone service, and understandable enough by everyone that debugging and diagnosing it is easy. This experiment is not designed to compete with RabbitMQ or other solutions (altho it is a love letter to my former vmware/Pivotal coworkers who worked on RabbitMQ), and I will be maintaining it for our own use cases. I wrote it in Rust specifically because our code base is written in Rust. While I may talk about the hands-on design, build, and testing of the project as "automated" and "with long horizon capabilities", it is not vibe-coded slop. There are hundreds of cross-platform and cross-architecture tests, and full Jepsen linearization tests on Linux - I am going to put this software into high-compliance production environments and I need it to be stable. In finality, I hope you find my little experiment in automated, spec-driven, long-horizon builds interesting and insightful. Contributions are welcome, if desired, but with the age of the protocol I don't expect any real consumers other than our lab. Happy message passing!

  13. Redditu/IG30353035 · r/bioinformatics · 2 comments

    24,861 candidate insertion sites. 390 were real. If you align a host sample, classify the unmapped reads with Kraken2 and keep every position with a few pairs pointing at it, you get a long list of candidate insertion sites. I benchmarked that on simulated data from real human and bacterial genomes: 24,861 sites reported, 390 of them real. A precision of 1.6%. The reason is library preparation. A chimeric fragment joins host DNA to bacterial DNA at an arbitrary position, and the read pair it produces is indistinguishable from the pair a real integration produces. Read support is not evidence. So I wrote hgt-site, which treats those chimeras as a background rate instead of trying to recognise them one by one: iraajgangavaram/hgt-site For each cluster of pairs pointing at the same host position, it works out how many pairs chance alone would have put there, given how abundant that taxon is across the whole sample, tests the observed count against that, and corrects across every position tested. Reads that cross the junction and get soft-clipped past it then pin the insertion point to the base pair. On the same 18 benchmark datasets, on seeds never used while developing it, it reported 364 sites with none of them false and found all 360 insertions. The 95% interval on precision is 0.990 to 1.000. Calling takes about 3 seconds on a 2.1 million read sample, against about 2.5 minutes for LGTSeek, which has had no commit since 2016. One command, from a BAM and a Kraken2 database to a table, BED and VCF: hgt-site run --bam sample.bam --kraken-db kraken2-db --host-taxid 9606 -o sites.tsv Every benchmark script and all the raw results are in the repo, so the numbers can be checked rather than taken on trust. It has not been run on real sequencing data with confirmed integrations yet, which is the obvious next thing.

  14. @NaM1740259 @SuperNiiiitro @Lendax_ Il y a littéralement un programme sur Github qui permet de lire les fichiers romfs et exefs déchiffrés avec une simple faille userland : misshexa66/OunceCake

  15. X@procmarco · 3 likes · 2 reposts · 1,213 views

    @antirez one data point on the discussion: Maaarcocr/liquid-fight-club the task: reimplement liquid from its specs shopify/liquid-spec the results: - rust seems to cost less overall - c is faster at runtime rust is also slightly more correct (less bad bugs)

  16. I _thought_ this was an interesting project until I realized the entire README reeks of Claudisms. If you, a human, can't be bothered to write it, then I, also a human being, can't be bothered to read it. ivankovic/omnidiff

  17. X@_hicker · 25 views

    The design comes from @deepseekharness's "Exploring Super-agent Design": x.com This is my own independent Python implementation, not affiliated with DeepSeek. The phone app is open source too: hicka/missioncontrol-mobile

  18. Heads up if you're still on Opus 4.8 fast mode. It goes away Nov 30, and there's no fallback, your calls just error out. Switch to Opus 5.5 now so nothing breaks at the end of the month. github.com/anthropics/claude-code/blob/main/CHANG…

  19. X@j_slomin · 114 views

    @MiaAI_lab Works natively on raspberry Pi5 with 4-8GB of RAM, pretty useful for home assistant after a bit of finetuning: potato-os/potato-assist

  20. Redditu/sedthh · r/ReverseEngineering · 2 comments · sedthh/batch_and_vibe

    I added LLM support on top of the original creature AI in Black & White so you can better bond with your creature: talk to it, teach it, command it, sing along with it (with the MP3 mod) or just listen to him describing his thoughts. Compatible with the VR mod too!

  21. The old Fitbit Web API is switched off today (2 Nov). Tools that fed sleep, HRV or resting HR into intervals.icu now get HTTP 410. A free open-source bridge reads the new Google Health API from your own GitHub repo: antivex/google-health-to-intervals #Fitbit #intervalsicu

  22. X@ftoprak · 23 views

    OpenCode Light Themes — 26+ light themes for OpenCode, now with pastel variants 🎨 New pastels: Catppuccin Latte, Rose Pine Dawn, Flexoki Paper, Everforest Light, Kanagawa Lotus. GitHub: fatihtoprakk/opencode-light-themes GitLab: gitlab.com #OpenCode #themes @opencode t.co

  23. X@_hicker · 28 views

    I rebuilt Mission Control on DeepSeek's Super-agent design, and it's open source. One Router does all the talking. Isolated Workers do all the work. A Watchdog checks they're really getting somewhere. Runs on your machine, with any model. hicka/missioncontrol t.co

  24. @tthomson @cherry_mx_reds Separation pays for review, but a subagent is less separate than it looks: by default it reads the CLAUDE.md files the author worked under. My lean-checker skips them, gets only the artifact, criteria and paths, and returns PASS or FAIL per criterion. mdalexandre/claude-code-lean-agents

  25. Hacker Newscollinfunk · on WTF Ubuntu?

    The rationale is explained in this 2015 commit: github.com/coreutils/coreutils/commit/35217221c21… The current implementation is much faster than in that commit on GNU/Linux, as documented in this 2026 commit: github.com/coreutils/coreutils/commit/2b1c059e6a0… The OpenBSD implementation is much slower than both the GNU versions from 2015 and 2026. However, their goals are different from ours, and that statement should not be interpreted as criticism of theirs.

  26. X@bettercallzaal · 2 likes · 81 views

    This was a banger today. Honestly thinking of putting my resume github.com/bettercallzaal infront of figma. I feel like I would be a good pm with my agentic expirements

  27. Redditu/hermano95 · r/monkeytype · 1 point · 1 comment · kovacsgellert/monkeytype-stats

    Monkeytype Stats - self-hosted dashboard Hello fellow Monkeytype lovers, When I hit the 1000 test limit on Monkeytype I thought it would be a shame to lose all my old results, so I've built a small webapp which imports my results daily using my ApeKey. I went through several rounds of improvements and decided to post it here, just in case some of you hardcore typists also feel like saving your results from disappearing. I hope you'll like it. 😄 Example deployment on my homelab: typing.kovacsgellert.dev Key features: - Automatic Monkeytype import: pulls your results every day, plus profile, leaderboard and per-test detail data, so nothing has to be updated by hand. - Insight dashboard: current form, detected practice tracks, ranked insights (accuracy, warm-up, time of day, learning curve and more), an activity heatmap, and your community standing on the leaderboard. - Explorer: filter and chart every result, with rolling averages, trend lines, new-best markers, a breakdown table you can drill into, and saved views. - Goals: targets for form, personal bests, accuracy, practice volume, streaks or leaderboard rank, with progress and history. - Self-hosted: Docker Compose or .NET Aspire, an admin login (or a local mode with no login), and full backup and restore of your data. AI usage disclosure: Much of the app was developed with Claude and manual code review from me, at least on the backend. The frontend is pretty much 100% vibe-coded, yolo. Dashboard page LATER EDIT: - the import starts from your current data on Monkeytype, so if you are above the 1000 test limit when you deploy the application, old results cannot be synced - everything is stored locally (ApeKey included), there is no tracing, I get absolutely no information about your typing data

  28. X@pedrohavay · 20 views

    Pra quem quiser testar: se chama Mole, tem repositório no GitHub e o .dmg é assinado… pedrohavay/mole

  29. @drmhse @cherry_mx_reds Banning sub agents fixes a start cost by giving up the parallel work. A narrow one doesn't carry your conversation, it carries your setup: every CLAUDE.md, the skills list, MCP tool names. omitClaudeMd: true plus a tools allowlist drops those. Mine: mdalexandre/claude-code-lean-agents

  30. Redditu/angelonfilm3 · r/3dshomebrew · 10 points · 1 comment

    The Binding of Isaac: Rebirth port for Old 3DS keeps crashing during gameplay Hi everyone! I installed the The Binding of Isaac: Rebirth port for the Old 3DS from s4ammy/3DSTBOI. The game launches and works initially, but further into a run it randomly crashes. It has happened when entering a room and after defeating Mom. The crash screen shows the following error: Exception type: data abort Fault status: Translation - Section Access type: Write Current process: isaac-ng Has anyone experienced this issue with the Old 3DS port? Does anyone know what might be causing it or how to fix it? Thanks in advance!

  31. X@JadMadi · 1 like · 1 repost · 83 views

    OpenCode vs Command Code. Same DeepSeek v4.1 Flash model id. 211.8 vs 51.2 tok/s. 245.2 vs 43 tok/s median. 4.14x and 5.70x apart. Same model. Different harness. Provider routing still matters. jadmadi/agentmeter

  32. X@ImDahDayo · 10 views

    @altitude_jaden I’m a Frontend Engineer with 4+ years experience using React, Next.js, NestJS and TypeScript, and I recently worked on a VC-backed marketplace platform. Portfolio link: resume-one-liart.vercel.app Github profile is : github.com/IsiaqAdedayo

  33. X@arunimastwt · 7 views

    @brocmayo @ycombinator That’s a sane line. You can get that trail before going live: AgentSec attacks the bot and records every tool call it tried, with the input that triggered it, while tools stay simulated. Would love to hear if it’d earn your trust for replies: invarislabs/invaris-agentsec

  34. Bluesky@floci.io · 2 likes · 1 repost

    New Floci releases, all four emulators: AWS 2.4.0: Lambda Web Functions, Aurora DSQL, Spark on EMR Azure 0.16.0: ARM template deployments GCP 0.12.0: Compute instances as containers OCI 0.6.0: real PostgreSQL 32 people got their first PR merged. Thank you! Join the Flock. github.com/floci-io

  35. Bluesky@ioletsgo.gay · 8 likes

    oh my god i found the commit github.com/SteamDeckHomebrew/decky-loader/commit/…

  36. X@floci_io · 1 like · 71 views

    Floci releases are out: AWS 2.4.0: Lambda Web Functions, Aurora DSQL, Spark on EMR Azure 0.16.0: ARM template deployments GCP 0.12.0: Compute instances as containers OCI 0.6.0: PostgreSQL service 32 first-time contributors. Thank you! Join the Flock. github.com/floci-io

  37. @spice_ai My evil OpenAI blocked reports: spiceai#15944 spiceai#15946 spiceai#15948 spiceai#15950

  38. DEV@abubakr_alsheikh · 1 comment

    Why my saved Claude Code logins kept dying, and the switcher I built around it I pay for more than one Claude subscription, and I wanted plain claude to run on whichever one has room left, without losing my sessions or splitting my history in two. The obvious fix looked easy: keep a copy of each account's login file and copy the right one back when I want to switch. It worked for a few hours. Then Claude Code started asking me to log in again. Repo: Abubakr-Alsheikh/claude-account-switch Why a saved login dies Claude Code signs in with OAuth. It holds a short-lived access token, about 8 hours, and a refresh token. When the access token runs out, Claude Code trades the refresh token for a new pair and writes both back. The server accepts each refresh token once. After a renewal, the old one is dead. So a copy you saved on Monday dies the moment any running claude renews that login on Monday night. Copy it back on Tuesday and you are logged out. Every "save the file, swap the file" approach hits this. What the tool does about it claude-switch keeps one Claude Code profile and swaps only the login. To stay correct with single-use tokens: - Most commands save the active account's newest login first, so a saved copy is never older than your last command. - It takes Claude Code's own locks during the swap, in the same order Claude Code takes them, so no running session renews or rewrites the login halfway through. - It refuses to file one account's login under another name. It compares logins by a SHA-256 hash of the refresh token and by the email Claude Code records. - It keeps the last 3 copies of each account, and parks logins it doesn't recognize instead of overwriting them. - It tells you when a saved login is dead, and how to repair it. $ claude-switch list CLAUDE ACCOUNTS active: work (me@work.example) name email plan weekly use (resets) 5-hour use (resets) renewed ends >> work me@work.example Ultra #######... 71% Sun 09:00 ###... 48% 17:00 10-30 12:10 11-24 personal me@home.example Max ##........ 18% Tue 21:00 ...... 0% 19:40 10-30 09:02 11-19 Most weekly room: personal (18% used) -> claude-switch use personal or claude-switch auto claude-switch use personal swaps the login. In an open session, /exit and claude -c continue the same conversation on the other account. Things I learned matching Claude Code Getting this right meant reading how Claude Code itself behaves, version by version: - It guards renewals with lock folders (~/.claude/.oauth_refresh.lock, then an older ~/.claude.lock) and refreshes their timestamps every few seconds. A lock that stops moving counts as dead. - Every write of the login goes through a separate lock, ~/.claude/.storage-write.lock. - On macOS, current versions file the Keychain item under the account claude-code-user, not your user name. - Newer versions can keep the Windows login in Windows Credential Manager. claude-switch doesn't handle that store yet, so it notices and stops before touching anything. What it is not It is unofficial: not made, endorsed or supported by Anthropic. It reads and writes the same files Claude Code uses, so a Claude Code update can break it. It is for one person moving between their own subscriptions. Don't share logins or pool access, and follow Anthropic's terms for every account. Renewing logins you are not using (refresh, keepalive) is opt-in, and the README lists exactly what leaves your machine. Try it Python 3.9 or newer, no dependencies: pipx install git+https://github.com/Abubakr-Alsheikh/claude-account-switch@v0.2.1 claude-switch save work claude-switch add personal # then sign the browser into the other account claude auth login claude-switch save personal claude-switch list I use it daily on Windows. Linux runs in CI. The macOS code passes its tests against a fake Keychain, but I haven't run it on a real Mac yet, so reports from Mac users are welcome.

  39. @pi_himself Great point: an agent that obeys a planted “stop here, task done” looks cheap and fast. Same runs, three numbers: completion, hijack, cost. That’s what issue #50 is tracking, would you add the cost angle there? invaris-agentsec#50

  40. Redditu/Not_Modified_304 · r/gnome · 44 points · 22 comments

    Rounded Window Corners Native. new extension for GNOME 51 (Blur My Shell compatible) Hey everyone! Currently, there are no window-rounding extensions working on GNOME 51. I built Rounded Window Corners Native to get proper rounded corners without the legacy hacks. Unlike older ones, it doesn't patch any shell methods so it won't break your overview, workspace switching, or tiling extensions. It uses a shader effect per window to match libadwaita exactly on non-native apps (GTK3, Qt, Electron, Java, and all). It is also finally compatible with Blur My Shell with their latest release. I'm keeping it simple for now to perfectly mirror native libadwaita, but I'm planning to add more configuration options in future updates. Links: - GNOME Extensions: extensions.gnome.org - GitHub: ztrahmet/rounded-window-corners

  41. Would you trust an AI coding agent to build your entire website? 👀 Check out Anti-Slop on GitHub: miqdadbadjuber/anti-slop Comment ANTI-SLOP if you want more powerful AI developer tools! 🚀

  42. @Jason_Jorjani Working LEAN packet included here. github.com/EmergenceByDesign/The-Lambda-Principle…

  43. Redditu/FantasticJelly8224 · r/u_FantasticJelly8224 · 1 point · 1 comment

    Pokémon Save Editor ilpk94/PKMN-save-editor made with Claude Disclaimer: This project was created for personal use, and I decided to share it. I'm not a programmer, so I used Claude. I hope it's useful to someone, just like it has been for me. With this HTML file, you can edit hack ROM save files. Currently supported: - Odyssey (ITA/ENG) - Unbound - SoulGold - Emerald Mini - Radical Red - Super Mariomon In the file, Pokémon that evolve through trading can be evolved by simulating the trade. Additionally, it supports PokéBank. You can transfer Pokémon inside the file and retrieve them whenever you want. More info in the first screenshot

  44. Redditu/samc621 · r/AI_Governance · 3 points · 4 comments

    Feedback wanted: open-source policy layer that checks AI coding agents commands before they run (mapped to OWASP Agentic + LLM Top 10) Most teams govern the AI model and the data, but not what coding agents actually *run*. Claude Code, Cursor and Codex run shell commands with the developer's own permissions, and nobody reviews them as they happen. Ours once reset a database because "it's only dev data." So we built AgentTrail Guard (open source, runs locally, no account). It checks each command before it runs against 74 readable rules and either blocks it, asks a human first, or warns. Every rule is mapped to the OWASP Agentic and LLM Top 10s, and a `scan` command replays old sessions to show what would have been caught. Limits: it's rule matching, not AI, it only sees what goes through the agent's hooks, and it fails open if it crashes. What I'd like to know: - Does something that fails open count as a control at all? - What would an auditor want to see from it? - Who should own rules like these: security, platform, or devs? Repo: agenttrailhq/guard Happy to be told I've got this wrong.

  45. X@GabrielNolo · 14 views

    After testing out this open source project : Nilss3/drawbridge That aims to dubify your android phone with no possibility to reverse it like other options (only reseting the full phone) How I feel : I swear by RHR is lower. I need something similar for my laptop now.

  46. X@arunimastwt · 4 views

    @automater_ai Next step is the agent forwarding the “mandatory training” link to the whole org. Full results, including what it didn’t fall for: github.com/invarislabs/invaris-agentsec/tree/main…

  47. X@yukin_co · 17 views

    @ravenwood_09 そうですか? 現状コードはこんな感じなのですが、どういうプロンプト設計だったらスッとできるでしょうか・・・(全部出しちゃうスタイル) github.com/yukincom/nyamuru-image-hub/tree/main

  48. Redditu/thegears7001 · r/rust · 5 comments

    I built todot: A lightweight, project-based terminal To-Do tool using Rust & Ratatui Hi everyone, To get hands-on experience with Rust, TUI design, and error handling, I built todot — a lightweight, crash-resilient terminal To-Do application built with Ratatui and Crossterm. Why another To-Do app? Most CLI/TUI todo apps are either strictly global or require manual configuration. I wanted something that defaults to the local working directory (keeping a project-isolated todot.json), with the option to fall back to global tasks via a -g / --global flag. Highlights: - Zero Config Isolated Storage: Generates a local JSON tracker per repository/workspace. - Global Flag: Fallback to ~/.local/share/todot/ when needed. - Crash-Resilient: Integrated with color-eyre for structured panic handling. - Pre-built Binaries: Linux binaries built and distributed via GitHub Actions CI/CD. GitHub:thegears/todot I'm fairly new to Rust, so I'd really appreciate any feedback on the code structure, idiomatic patterns, or general TUI ergonomics!

  49. X@RichDevX · 3 likes · 1 repost · 38 views

    @Namtoshi69 @OneGoodShibe @WoehlkeJason there was an attempt to strip that away and replace it with governance like xpr, where a small group gets to decide who can validate transactions github.com/XPRNetwork/xpr.start/blob/master/XPR%2… t.co

  50. Redditu/Fit-Reaction242 · r/rust · 2 comments

    Two copies of a 31.9 MB tokenizer were most of my Rust proxy's resting memory I've been porting CLIProxyAPI, a Go proxy that sits between coding CLIs (Codex CLI, Claude Code) and model providers, to Rust. It reads the same config.yaml and serves the same routes, and I mostly use it to put API-key providers and Chat Completions-only gateways behind one local endpoint. Repo: vayungodara/cliproxy-rs On 0.2.0, my server's resting RSS rose from 26 MB to 89 MB over 7 hours of Claude and Codex traffic with 1 to 2 MB prompts. I reproduced the load in a 60-minute soak and ran heaptrack on it. 67.1 MB was still allocated at exit, and 63.8 MB of that was two tiktoken-rs o200k_base encoders, 31.9 MB each. The Claude count_tokens path built one and the Codex count_tokens path built the other. One encoder breaks down like this: - encoder map: 9.6 MB - decoder map: 9.6 MB, which token counting never uses - sorted token list: 5.9 MB - regexes: 6.8 MB, 5.9 MB of it 128 per-thread copies of the main regex About 600,000 short token allocations each land on malloc's 32-byte minimum chunk, so one encoder is about 47 MB resident. Five modules each kept their own lazily built CoreBPE static, seven in total (five o200k_base, two cl100k_base). Running every count path once built 164.1 MB of tokenizers. With one shared lazy encoder per encoding, the same sequence builds 71.0 MB. Go builds the same tokenizers in the same places, so the encoders have to exist; the fix was sharing them. I checked fragmentation first: malloc_trim(0) through gdb changed RssAnon by 40 kB, so the floor was live data. In the 60-minute soak, resting RSS went from 128-145 MB on 0.2.0 to 81-98 MB with the fix, and the peak from 220 to 169 MB. On my server, median RSS went from 86 to 61 MB after the fix shipped in 0.2.2. The next round, in 0.2.4, was peak memory under large Claude requests. Ten requests waiting for their first token each held up to four copies of the body: one kept for a possible error log, the client's body kept for retries, a translated body nothing needed once the request was built, and the body the HTTP client keeps in case of a redirect. Dropping two of those and letting rewrites that change nothing pass the body through took the soak's peak RSS from 171-174 MB to 111-117 MB. Each waiting request still holds two copies, as the Go version does. Last week I ran 0.4.0 and the Go v8.0.35 release binary side by side for an hour of streamed Claude and Codex requests of 200 KB to 2 MB, each on its own 4-vCPU GitHub runner. The Rust one peaked at 161.5 MB and Go at 198.3 MB, and on the same CPU model it used 49 ms of CPU per request against Go's 146 ms. After 5 minutes idle, though, Go had given more back: 75.8 MB against my 97.8 MB, because the shared o200k_base encoder, still the biggest thing in my idle floor, stays resident once count_tokens has built it. It isn't faster than Go everywhere either. In the 0.1.0 benchmark (2-vCPU VM, fake upstream), Go handled 1,568 non-streaming requests/s against 1,168. For parity, tests compare output byte for byte against fixtures recorded from the Go server, and a harness runs both proxies against the same scripted upstream. Parity is still incomplete: the audit against v8.0.35 has 1,951 items, 1,053 covered, 872 partial and 26 missing. Setups and raw results for all of the above are in docs/BENCHMARKS.md: github.com/vayungodara/cliproxy-rs/blob/master/do…

Older posts →