Mentions

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

Mentions by source

X

7,038
Nov 17, 17:00Nov 18, 17:00

Bluesky

2,235
Nov 17, 19:00Nov 18, 19:00
Nov 17, 19:00Nov 18, 19:00
Nov 17, 19:00Nov 18, 19:00
Nov 17, 19:00Nov 18, 19:00
Nov 17, 19:00Nov 18, 19:00
Nov 17, 19:00Nov 18, 19:00
Nov 17, 19:00Nov 18, 19:00
Oct 14, 21:00Oct 15, 21:00

Delayed · data through Oct 15, 21:00 UTC

DEV

804
Nov 17, 19:00Nov 18, 19:00
Nov 17, 19:00Nov 18, 19:00
Nov 16, 11:00Nov 17, 11:00

Delayed · data through Nov 17, 11:00 UTC

Nov 17, 19:00Nov 18, 19: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 17, 19:00Nov 18, 19:00

Latest posts

  1. X@vidar_0208 · 5 views

    Repo: pmndrs/postprocessing (Zlib license), branch main, commit 9cf03cf (npm 6.39.5) Code: VignetteEffect, ChromaticAberrationEffect (radial modulation) and NoiseEffect are used unchanged from the library, with EffectComposer and EffectPass. The panic mapping, the teal tint and the edge ripple are my own shader code. Scene, boat, sea and lighting are my own procedural build. Inspired by DREDGE's panic effect (Black Salt Games). No DREDGE assets, UI, colours or music are used or imitated.

  2. X@Masih_Ghasri · 10 views

    خلاصه فنی پروژه: ▫️ کاملاً تک‌فایلی (Single Translation Unit) ▫️ منطبق بر استاندارد POSIX.1-2008 «Latveria's processes obey. All of them. Always.» 🦾 سورس‌کد و مستندات در گیت‌هاب: Masih-Ghasri/latv-sh خوشحال میشم نظراتتون رو بشنوم! اگه براتون جالب بود ریتوییت کنید 🔁 t.co

  3. X@DarceX26 · 6 views

    mcp-guard connects like a client would and checks 24 rules: poisoning, shadowing, leaked secrets, over-broad permissions. Open source: diegoperezg7/mcp-guard

  4. X@daradoescode · 10 likes · 346 views

    @LukeberryPi kind of both LOL should be fixed soon t3code#29398

  5. YouTubeRepo Team · YouTube description · 21 views

    AI yordamchingiz uchun 5000+ koʻnikmalar #Shorts OpenClaw mahalliy AI yordamchisi uchun saralangan va toifalangan koʻnikmalar toʻplami. Repozitoriya: VoltAgent/awesome-openclaw-skills Litsenziya: MIT · Muallif: @VoltAgent #gitxazina #github #openclaw #ai

  6. X@HaStrive · 44 views

    @yetone Source: yetone/magpie Docs: usemagpie.ai

  7. X@vonealex · 6 likes · 2 reposts · 182 views

    Atualizei o repositório de estudo das aulas da Profa. Cibele Russo (ICMC/USP), @cibelerusso: 9 vídeos novos, catálogo 231 para 240. Cada aula ganhou guia de estudo e slides. Conteúdo aberto: alexander-stack1/ciencia-de-dados-cibele-russo

  8. EXPLORE 10000 FREE SHADCN UI THEMES! 🎨 Jln13x Ui.jln.devProvides 10,000+ themes for shadcn/ui. jln13x/ui.jln.dev t.co

  9. YouTubeAlex Hitt · YouTube description · 1 like · 131 views

    Emdash GitHub Overview: Parallel Coding Agents with Isolated Git Worktrees emdash by generalaction: generalaction/emdash Emdash is an open-source, local-first orchestration layer for running autonomous command-line coding agents in separate Git worktrees. This overview explains why multiple agents sharing one checkout can contend for files and the Git staging index, and how per-task worktrees, preserved local configuration, PTY and ACP runtimes, and local SQLite state structure parallel work. It then follows a fictional Project Aurora example through isolated backend and interface tasks, embedded Monaco diff inspection, inline feedback, verification, and merge. The final section frames the trade-offs: provider rate limits remain with the underlying CLIs, there is no unattended task queue, and semantic integration across branches still depends on human verification. TimeStamps: 0:00 From autocomplete to autonomous CLI agents 0:37 Single-checkout concurrency constraints 0:59 Emdash and isolated task orchestration 1:25 Worktrees, local state, and dual runtimes 2:34 Diff inspection and inline agent feedback 3:17 Verification, branch merging, and gatekeeping 3:35 Operational trade-offs for local-first orchestration 3:56 Semantic integration across parallel branches 4:28 From code generation to system integration 🧩 Git worktree isolation separates concurrent agent tasks 🖥️ PTY and ACP runtimes share a local orchestration layer 🔎 Monaco diff inspection keeps human verification in the loop 🔗 Semantic integration remains a human responsibility Emdash's central model is straightforward: isolate each task at the filesystem level, then bring the branches together through deliberate human verification. That makes Git worktrees, ACP and PTY execution, local SQLite state, diff inspection, and cross-branch contract checks the key concepts to evaluate when considering parallel coding-agent orchestration. #Emdash #GitWorktrees #AICodingAgents [de-DE] YNAS ynp_7a52ec010aeb707b Cinematic Privater automatisierter Staging-Upload. Paketidentität: ynp_7a52ec010aeb707b; Ausgabe: cinematic. [es-US] Cinemática de YNAS ynp_7a52ec010aeb707b Carga de entorno de prueba de automatización privada. Identidad del paquete: ynp_7a52ec010aeb707b; salida: cinemática. [fr-FR] YNAS ynp_7a52ec010aeb707b cinématique Téléchargement de l'environnement de test d'automatisation privé. Identifiant du package : ynp_7a52ec010aeb707b ; sortie : cinématique. [hi] YNAS ynp_7a52ec010aeb707b सिनेमैटिक निजी स्वचालन स्टेजिंग अपलोड। पैकेज पहचान: ynp_7a52ec010aeb707b; आउटपुट: सिनेमाई। [id] YNAS ynp_7a52ec010aeb707b sinematik Unggahan staging otomatisasi pribadi. Identitas paket: ynp_7a52ec010aeb707b; output: sinematik. [it] YNAS ynp_7a52ec010aeb707b cinematic Caricamento di automazione privata. Identità del pacchetto: ynp_7a52ec010aeb707b; output: cinematografico. [pt-BR] YNAS ynp_7a52ec010aeb707b cinematográfico Upload de teste de automação privada. Identificação do pacote: ynp_7a52ec010aeb707b; saída: cinemática.

  10. X@500altcoins · 16 views

    the tx: etherscan.io /ape-check is free, one file, no API keys: 500bitcoins/ape-check

  11. X@marcuspat · 3 views

    ContextForge v1.0.0 — compress prompts 3–20× and prove nothing important was lost: every number, date, URL and name verified, with a savings ledger. Deterministic, offline, zero deps. adventurewave-labs/contextforge t.co

  12. X@BHolmesDev · 5 views

    @commandlive @Vasu_ai123 @warpdotdev We've open sourced our factory configurations, which you can use directly or adapt to your agent setup. We'll be expanding this with more detail soon: warpdotdev/warp-factory-examples

  13. Redditu/SerakSan · r/legendofzelda · 9 points · 4 comments

    I made a little Minish Cap scene maker Hey! I've been working on Minish Studio, a free little editor for making your own Minish Cap scenes. You can mess around with the game's sprites, add dialogue, and make simple animations. I wanted a way to make game-style posts and carousels, and it grew from there. It's a pretty niche fan project, but I thought a few people here might have fun with it :) It runs in your browser, there's an offline download too, and your scenes stay on your device. The animation side is still a bit rough. Try it: seraksan.github.io GitHub / offline download: SerakSan/minish-studio Made by SerakSan. Unofficial fan project. Game art belongs to Nintendo/Capcom; sprite and map contributors are credited here: github.com/SerakSan/minish-studio/blob/main/CREDI…

  14. What cloud coding agents are, and what self-hosting one takes A cloud coding agent takes a task from outside the editor—an Issue, a chat mention, a prompt box—runs it in an environment you did not set up on your own laptop, and returns a branch, a diff, or a pull request for review. GitHub, Cursor, OpenAI, Anthropic, Cognition, and xAI all sell some version of it now, under names like cloud agent, background agent, cloud session, or autonomous software engineer. The engineering problem is not the model call. That part is a base URL, a key, and a model ID. The hard part is everything around it: a trigger that works with the laptop closed, an environment that can clone and build the repository, a credential boundary, and an output a person can review. This article maps the category, walks the loop, names where it breaks, and then looks at DeepSeek’s open-source Super-agent prototype, which moves the control plane to a machine you operate. The category is three parts Every product in this category shares the same shape: - A trigger that does not need an open editor. Work arrives as an Issue assignment, an @mention in Slack or Feishu, a prompt in a web app, an API call, or a CLI handoff. - An environment outside your machine. The agent clones the repository, installs what it needs, and works in a sandbox or workspace managed by the vendor or your organization. - A reviewable result. It ends with a branch, a diff, a draft PR, or a comment—something a person can review and act on. That separates the category from two neighbours. A local IDE agent runs on your laptop while you watch; a chat assistant answers questions without touching the repository. A cloud coding agent sits between them: it has real tools and a real checkout, but the human is meant to leave. The word bot describes the chat-native shape of the same idea. Instead of assigning an Issue, you mention the agent in Slack, Teams, or Feishu. The trigger changes; the remote environment does not. The output can be a PR, a diff, or a set of finished files. The product map | Product | Starts from | Runs in | Returns | |---|---|---|---| | GitHub Copilot cloud agent | Issue, @, Agents panel | Cloud sandbox or Actions | Branch or PR | | Cursor Cloud Agents | Desktop, web, Slack, Linear | Isolated cloud VM | PR | | OpenAI Codex Cloud | ChatGPT web, desktop, mobile | Cloud workspace | Changes or PR | | Claude Code cloud sessions | Browser, mobile, desktop, terminal | Anthropic-managed VM or self-hosted environment | Branch or PR | | Devin | Slack, Teams, web, CLI, API | Workspace with terminal, editor, browser | Draft PR | | Grok Bot | Desktop/mobile chat, @bot on X | Cloud machine (Cursor-hosted) | Files or drafts | The “Runs in” column follows each vendor’s own wording. Isolation details differ, and Devin’s documentation does not describe its VM architecture or isolation guarantees. Grok Bot is the broadest entry: xAI describes it as a persistent AI teammate, started from desktop or mobile chat, or by mentioning @bot on X when the accounts are linked. It runs on an account-level cloud machine hosted by Cursor, with browser, storage, and command-line access. Its documentation describes finished files and drafts, not a repository workflow; branch and PR creation are not documented. That places it at the bot end of the spectrum. Four differences matter more than the table: Where the trigger lives. GitHub Copilot cloud agent and OpenAI Codex Cloud are designed around work that already lives in GitHub or the ChatGPT app. Cursor Cloud Agents and Devin lean chat-native: a Slack or Teams thread is the front door. Claude Code cloud sessions accept the trigger from a browser, a phone, the desktop app, or claude --cloud in a terminal, and can also run on a schedule. How much the vendor shows you. Claude Code documents its isolation in detail: in Anthropic-hosted environments, each session runs in an isolated VM, network access is limited by default, and git credentials stay outside the sandbox, with a proxy authenticating on the session’s behalf. Organizations can route sessions to a self-hosted environment instead, where isolation is their responsibility. Cloud sessions share the plan’s rate limits, with no separate VM charge; they require a claude.ai sign-in and are not available when Claude Code is configured for Amazon Bedrock, Google Cloud’s Agent Platform, or another third-party provider. The other vendors publish less about the internals; “sandbox” or “VM” is often the end of the public description. What the agent is allowed to touch. Some products are scoped to a single repository; others advertise organization-wide or multi-repository work. This is the first thing to check against your own setup, because a capable agent with the wrong repository scope is either useless or dangerous. What kind of work it is for. Most of this list is repo-scoped coding. Grok Bot is a general cloud teammate: its docs describe files and drafts, not a repository workflow. Read “cloud agent” as a spectrum, not a single product shape. How the loop runs Strip away the branding and the loop is similar everywhere: 1. Intake. A trigger arrives. The product decides whether it is a real task, sometimes asks one clarifying question, and queues a session. 2. Environment. The agent clones the repository at the right branch, runs a setup script or image, and installs the toolchain. Network access and secrets are configured here, not later. 3. Work. The agent reads code, edits files, runs tests and commands, and occasionally opens a browser. Long tasks continue after your laptop sleeps. 4. Output. It pushes a branch and opens a PR, or leaves a diff and a written summary. Some products return draft PRs because the agent is expected to stop before merge. 5. Review. A person reads the diff, comments, and either merges, asks for changes, or takes the work back into a local session. Some products can also watch the PR and push fixes when CI fails. The differences that bite are in steps 2 and 5. A setup script that takes too long, a repository the agent cannot clone, a network policy that blocks a package registry, or a credential the sandbox cannot see will stop a task that looked simple. And “reviewable output” still means a human reviews it: none of these products removes the review step, they move the typing. Why this wave is happening now Three conditions had to line up. Models became reliable enough to run long tool loops without constant supervision. Sandboxes and setup scripts became cheap enough to give every task its own environment. And the pull request became the default interface between an agent and a reviewer, which means teams did not have to invent a new review process. There is also an attention argument. DeepSeek’s companion design essay makes it explicitly: a single task is limited by the model, but a person’s throughput across many tasks is limited by attention. A cloud agent moves session management, context switching, and waiting off the person. That claim comes from DeepSeek’s essay, not from an independent study, but it describes why the category feels useful. Where it breaks Every hosted product trades control for convenience: - Trust boundary. Your code, and sometimes your credentials, leave your machine. Vendors publish different levels of detail about isolation, retention, and network access; read them per product rather than assuming the category is uniform. - Isolation. A managed VM is designed to contain the agent, but it is still the vendor’s environment. “Sandbox” can mean anything from a hardened VM to a container with broad network access. - Customization. Hosted agents expose settings, not source code. If your workflow needs a different trigger, a different review rule, or a different model, you are limited to what the product offers. - Cost model. Most of these products bill through a subscription or plan with usage limits; the agent’s time is not a line item you control directly. Budget by plan, not by token. - Scope and lock-in. Multi-repository support, chat integrations, and enterprise controls vary by vendor, and moving a workflow from one to another is not free. The self-hosted example: DeepSeek’s Super-agent DeepSeek’s release is interesting because it asks what the same loop looks like when the control plane stays with you. The repository is deepseek-ai/dsh-superagent-prototype, an MIT TypeScript plugin for DeepSeek Harness (DSH), version 0.1.0, published as a research prototype. The README is explicit: it is adapted for publication, it is not identical to DeepSeek’s internal version, and it does not implement every idea in the design essay. Its shape is a long-lived Router session and a Worker session per ticket. Events flow through Source → Trigger → Thread → Eval → Mandate → Ticket → Assignment → Executor. A team authorizes work through a policy; explicit @mentions from allowed people are accepted, while proactive work starts in observe mode, which records what the agent would have done without opening tickets. Each Ticket gets its own session and directory; a prepare command can create a git worktree per ticket. The operating model is the opposite of a vendor sandbox. It listens to one github.com repository (no GitHub Enterprise Server) and optionally Feishu. Both Router and Worker presets run with danger-full-access as the operator’s OS user; account wrappers choose the agent’s credentials but do not isolate the process. The deployment guide’s advice is a dedicated OS account that holds only the agent’s credentials. State lives in SQLite under a configured stateDir. The philosophy is written as a budget: take as little human attention as possible, and give as much value as possible. The prototype does not hard-code a model. It uses the Harness profile default unless Eval or Execution overrides it, so a team can put a lighter model on the Router and a stronger one on Workers. The design essay reports scheduling numbers from a synthetic workload—about 300 messages and 20 work requests, simulated tools, five runs—with a p50/p95 around 12.4 / 15.7 minutes against about 29.5 minutes p95 for a single-session baseline that made no subagent calls. Those are the essay’s own measurements under simulated tools, not an independent coding-quality benchmark. What is not reproduced or verified - No live end-to-end ticket. This article does not report a Super-agent ticket executed from trigger to PR. - No independent performance result. The scheduling figures above are the design essay’s self-reported measurements under simulated tools, not coding-quality results. - No reproduction of the hosted products. Capabilities for Copilot, Cursor, Codex Cloud, Claude Code, Devin, and Grok Bot come from their official documentation, not from tests run here. - Research software with no default sandbox. The README calls the plugin a research prototype, and its presets run with danger-full-access. A team trying it should use a dedicated OS account and a dedicated agent GitHub account. Models, hosting, and what stays yours AIHubMix connects DeepSeek Harness through an OpenAI-compatible endpoint at https://aihubmix.com/v1; the example in the DeepSeek Harness guide uses provider aihubmix and model auto. The guide covers the base DSH connection, not the Super-agent plugin. AIHubMix does not host the Super-agent process: the Router, state, polling, and shell run where DSH was installed. The hosted products above manage their own model selection. Sources 1. deepseek-ai/dsh-superagent-prototype — README, the design essay it cites, and docs/000–008 2. Connect DeepSeek Harness to AIHubMix — AIHubMix 3. GitHub Copilot cloud agent — GitHub Docs 4. Claude Code in the cloud — Anthropic 5. Grok Bot documentation — xAI

  15. Redditu/Mean-Skin5563 · r/EmulationOnAndroid · 202 points · 33 comments

    GTA VICE CITY ON JAVA GAME 🤣🤣🤣👍 What do you think? aidencantcode/GTAVCJ2ME

  16. DEV@retainingwallcalc · 1 reaction

    Why One Retaining Wall Formula Is Never Enough: Comparing Segmental Blocks, CMU Mortar Modules, Timber Sleepers, Gabions & Poured Concrete A 30-foot retaining wall with 3 feet of exposed height sounds like a single, fixed geometry problem: 30 ft × 3 ft = 90 sq ft of visible face. Yet when you turn that 90-square-foot face into an actual supplier purchase order, the required quantities diverge sharply depending on the material system, regional manufacturer packaging, mortar joints, and below-grade assumptions. At Retaining Wall Calc, we expanded our open calculation model (v1.1) to cover eight distinct calculator workflows, three international metric/imperial product hubs (Australia, UK, and Canada), and five buyer planning guides. Here is the complete mathematical breakdown of how each system behaves—and what to check before requesting supplier quotes. 1. Segmental Blocks vs. Producer Pallet Increments (178 vs. 139 Blocks) In a generic retaining wall block calculator using 16 in × 6 in units, a 30 ft (360 in) course requires ceil(360 ÷ 16) = 23 blocks per row. Six exposed courses (36 ÷ 6) plus one buried course gives 7 courses × 23 = 161 net blocks, or 178 blocks after a 10% cutting and breakage allowance. However, commercial segmental units rarely measure an exact 16 × 6 in, and pallet counts vary by regional producer. In our Allan Block counts and pallet calculator guide, using published New York producer data (Zappala Block) for AB Classic (17⅝ in long × 7⅝ in high × 11⅞ in deep, packed at 40 units/pallet): - Units per course: ceil(360 ÷ 17.625) = 21 blocks - Exposed courses: ceil(36 ÷ 7.625) = 5 courses (38.125 in of constructed exposed blockwork) - Total courses (with 1 buried course): 5 + 1 = 6 courses - Net blocks: 21 × 6 = 126 net blocks - Order quantity (10% allowance): ceil(126 × 1.10) = 139 blocks - Full-pallet purchase (40 units/pallet): ceil(139 ÷ 40) = 4 pallets (160 supplied blocks, or 21 blocks above the order allowance) For the exact same 30 ft × 3 ft wall using AB Jumbo Jr (8¾ × 7⅝ in, 80/pallet), the takeoff doubles to 252 net blocks, 278 blocks to order, and 4 pallets (320 supplied units). Keeping net units, allowance units, and pallet rounding separate prevents overpaying or under-ordering. 2. Mortared Cinder Blocks (CMU): Actual Size + Mortar Joint (152 Blocks) Dry-stacked segmental blocks touch directly, whereas mortared concrete masonry units (CMU) include a mortar bed and head joint. In our cinder block retaining wall calculator, entering nominal dimensions and adding a mortar joint would double-count the joint. Instead, the formula computes the installed module from the actual unit dimension plus one joint thickness: Installed Module = Actual Unit Dimension + Mortar Joint Thickness For a standard 15⅝ in × 7⅝ in (15.625 × 7.625 in) CMU block with a ⅜ in (0.375 in) mortar joint: - Installed module: 16.0 in × 8.0 in - Units per 30 ft course: ceil(360 ÷ 16) = 23 blocks - Courses: ceil(36 ÷ 8) = 5 exposed courses + 1 buried course = 6 total courses - Net & Order count: 23 × 6 = 138 net blocks → 152 CMU blocks with 10% allowance (115 exposed + 23 buried + 14 allowance). (Note: In Australia, Adbri's 20.01 hollow Besser block measures 390 × 190 × 190 mm, which forms a 400 × 200 mm module with a 10 mm mortar joint.) 3. Landscape Timbers & Wood Sleepers (36 Timbers) When building with wood sleepers or railway ties, nominal lumber labels (6×6 or 8 ft) often differ from dressed dimensions. Using our timber and wood retaining wall calculator for a 30 ft × 3 ft wall with 96 in (8 ft) long timbers and a 5.5 in actual vertical course height: - Timbers per course: ceil(30 ft ÷ 8 ft) = 4 timbers - Courses: ceil(36 in ÷ 5.5 in) = 7 exposed courses + 1 buried course = 8 total courses - Net & Order count: 4 × 8 = 32 net timbers (28 exposed + 4 buried) → 36 timbers with a 10% allowance, plus 0.89 yd³ base aggregate and 3.87 yd³ behind-wall drainage stone. 4. Gabion Baskets & Bulk Rock Fill Density (10 Baskets & 30.03 Tons) Wire gabion walls require two separate rounding models: whole-basket layout rounding and void-inclusive bulk rock density. In our gabion wall calculator, a 30 ft run with a 6 ft total basket height using 6 × 3 × 3 ft baskets yields: - Whole baskets: ceil(30 ÷ 6) × ceil(6 ÷ 3) = 5 × 2 = 10 baskets - Geometric fill volume: 10 × (6 × 3 × 3) = 540 ft³ = 20.0 yd³ net - Order volume (5% stone allowance): 20.0 × 1.05 = 21.0 yd³ - Rock tonnage: Using a quarry bulk fill density that accounts for inter-stone air voids (such as Gabion1 USA's published 2,860 lb/yd³ reference rather than solid granite specific gravity), 21.0 yd³ × 2,860 lb/yd³ = 60,060 lb = 30.03 US short tons. 5. Poured-Concrete Stem vs. Footing Elevation (5.70 yd³) The most common arithmetic mistake in cast-in-place concrete retaining walls is measuring the upright stem from the bottom of the footing and then adding the full footing volume—counting the intersection zone twice. Our poured-concrete retaining wall calculator separates the stem height above the footing top from the rectangular footing beneath it (supporting both constant-thickness and linearly tapered stems): - Upright stem (30 ft × 4 ft above footing × 8 in thick): 30 × 4 × (8 ÷ 12) = 80 ft³ (2.963 yd³) - Rectangular footing (30 ft × 24 in wide × 12 in thick): 30 × 2 × 1 = 60 ft³ (2.222 yd³) - Combined net concrete: 140 ft³ (5.185 yd³) - Order estimate (with 10% contingency per NRMCA CIP 31): 154 ft³ = 5.704 yd³ (4.361 m³) 6. International Product Modules (Australia, UK, & Canada) Because block modules, aggregate densities, and drainage pipe coils differ across metric and hybrid markets, we launched three dedicated regional calculators: 1. Retaining Wall Calculator Australia (AUD & m³): Models a 10 m × 0.6 m wall using Adbri Versawall Standard (400 × 200 × 215 mm, 60/pallet) → 100 net blocks, 110 blocks to order (2 pallets = 120 blocks), 38 caps (300 mm coverage), 0.64 m³ base, 2.15 m³ drainage (4.46 tonnes at 1.6 t/m³), and notes Brisbane City Council's 1.0 m building-approval criteria. 2. Retaining Wall Calculator UK (GBP & Metric Tonnes): Models a 7.2 m × 0.4 m wall using Marshalls Croft Stone (300 × 100 × 170 mm, 90/pack) → 120 net blocks, 132 blocks to order (2 merchant packs = 180 blocks), 0.40 m³ MOT Type 1 base, 1.19 m³ drainage aggregate, 25 m land-drain coil, and UK Planning Portal / Party Wall Act considerations. 3. Retaining Wall Calculator Canada (CAD & Hybrid Packages): Models a 12 m × 0.75 m wall using Unilock Ontario Pisa2 (200 × 150 × 300 mm, 72/bundle) → 360 net blocks, 396 blocks to order (6 bundles = 432 blocks), 22 coping pieces, 4.16 m³ total stone (6.65 tonnes), a 50 ft (15.24 m) Big O pipe coil, BC Housing freeze-thaw context, and Calgary's 1.2 m permit rule. 7. Base Depth, Terraced Hillsides, Permits & 2026 Cost Benchmarks Before turning a quantity takeoff into a purchase order, check four site and budgeting boundaries: - Base Depth & the 1/3 Rule Explained: Keep compacted leveling-pad thickness (4–6 in), block embedment (6 in), total trench depth (6 + 6 = 12 in), and base width separate rather than relying on an ambiguous "1/3 rule." - Hillside & Terraced Wall Planning: Calculate each terrace tier as an independent schedule (e.g., a 30 ft × 3 ft lower tier = 178 blocks plus a 24 ft × 2 ft upper tier = 99 blocks → 277 blocks kept on separate tier schedules) while having a qualified engineer evaluate global slope stability and tier interaction. - Retaining Wall Permit Height Limits: A 3 ft exposed face can still trigger a permit if the municipality measures from the bottom of the footing to the top of the wall (such as Seattle's 4 ft footing-to-top threshold) or restricts retained earth and surcharges (such as Fairfax County's 3 ft retained-earth rule). - 2026 Cost per Square Foot & Linear Foot: Convert square-foot installation benchmarks ($20–$50/ft² broad planning reference vs. $80–$90/ft² regional contractor reference) into linear-foot rates by multiplying by wall height, and verify whether quotes price exposed face area or total constructed courses. Explore the full formula documentation at retainingwallcalc.org and view our open-source Node.js calculation package on GitHub (retainingwallcalc/retaining-wall-materials).

  17. X@kscius · 11 views

    Qwen Code 0.26.5 puts a limit on PR autofix: if a check is still failing after three fix pushes, it hands off to a human. It also merges a stale base before trying fixes. That's the guardrail I want on any agent that pushes to my branches. github.com/QwenLM/qwen-code/releases/tag/v0.26.5

  18. Redditu/liansk · r/PCVR · 68 points · 6 comments

    Elden Ring VR mod 0.6.0 is out: Seamless Co-op crossplay, me in VR and my wife on a flat screen It's been a while since my last ERVR update: I was busy with my work on Spidy, my Spider-Man VR mod. ERVR is my native VR mod for ELDEN RING, and 0.6.0 is its first public release. The video is one Seamless Co-op session recorded in the headset: my wife on a flat screen, me in VR, up to the Beast Clergyman. New in 0.6.0 - Seamless Co-op: play with friends on flat screens. They need neither ERVR nor a headset. - A weapon wheel in each hand: hold a grip with the hand still, let go over a weapon to switch. - One launcher: it checks the game, the headset and your PC, sets the game up for VR and starts it with one button. - Game patch 1.17.2 (1.16.2 and 1.17.1 still work). - One hit per swing, scaled by how well you swing. - The frame rate follows the headset, and the game renders at the exact size your headset asks for. - bHaptics body haptics. - A players' guide with every control. What ERVR does - Full stereo at your headset's resolution: an image for each eye, from that eye's own camera. - First person: your head is the camera, and your character is there when you look down. - Your swing is the attack, and a faster swing hits harder. - Raise the shield to block, move it into a blow to deflect. - Grab the hilt to two-hand; the right trigger fires the Ash of War. - Spells and arrows fly where your hand points. - The HUD on its own panel; menus and cutscenes on a big screen. Ride Torrent. You need ELDEN RING on Steam (patch 1.16.2, 1.17.1 or 1.17.2), a PC VR headset with an OpenXR runtime (Quest Link, Air Link, Virtual Desktop or SteamVR), and a gaming PC: it renders twice, once for each eye. Offline or Seamless Co-op only, never with Easy Anti-Cheat on. Early and in development: reports are welcome. Download and guide: IlyaMez/EldenringVR Help and release news on the Discord: discord.gg Fan mod, free and open source. Not affiliated with or endorsed by FromSoftware or Bandai Namco.

  19. Redditu/EconomistCheap7581 · r/MediaServer · 2 points

    Stremio Offline: an open-source media server for NAS libraries, Stremio addons and Android TV (Docker) Hi everyone, I've been building Stremio Offline, a free, MIT-licensed media server and client for my own household. The main target is an always-on NAS, particularly a Synology with Intel QuickSync. I wanted one place to browse my existing media folders, use standard Stremio addons, keep a local library and continue watching from another device. The server runs on the NAS; phones and tablets use a browser, and there's a native Android TV client for the television. What works today - Multiple local libraries: point it at your existing movie and series folders, with automatic identification, posters, descriptions, favorites and viewing progress. A free TMDB API key improves metadata and artwork. - Direct play, remux and hardware transcoding: it tries to avoid converting video unnecessarily. Compatible Intel Synology models can use QuickSync/VAAPI; FFmpeg is included in the Docker image. - Separate household accounts: an administrator grants access to specific libraries and addons. Favorites, progress and Home layouts are personal. - Jellyfin and Emby libraries: browse, search and play their original media alongside local files. Provider libraries stay read-only, and viewing history is kept locally rather than written back to the shared remote account. - One search and a personal Home page: search across local libraries, connected media servers and addon catalogs. Each account can arrange its Home rows. - Persistent download management: restart recovery, partial-file resume, disk-full pausing, and season/whole-show preparation with quality and language rules. Following adds a release calendar and optional automatic episode downloads. - A richer player and title detail: audio/subtitle selection, chapters, intro/credits skips, configurable Up next, ratings, cast and crew, trailers and similar titles. IntroDB segment lookup is off in secure mode; richer metadata depends on the available providers. Deployment and clients Docker images are available on Docker Hub and GHCR for linux/amd64 and linux/arm64. There's a ready-to-use Compose example and a Synology Container Manager guide, including QuickSync setup and media-folder permissions. Mount the data directory and your media folders. Server state stays under your data mount, using SQLite for downloads, follows and library metadata, with accounts and settings in JSON. Back up the complete data directory with the server stopped; media folders need their own backup. There are also macOS Apple Silicon, Windows x64 and Linux x64 desktop apps. They can run their own server or connect to an existing NAS instance. The Android TV app connects to the server and supports remote-control navigation. Web and desktop have ten interface languages. Desktop builds are currently unsigned; the install guides cover the first-launch prompts. For access outside your home network, use a VPN or an HTTPS reverse proxy. The plain HTTP port is intended to stay behind that boundary. About development and AI I'm a software engineer with 15 years of experience, mainly in Java/Kotlin and Spring Boot on large fintech and e-commerce projects. This is my personal project, and I use AI extensively in its development, alongside code review, automated tests and deployment checks. The source, tests and CI workflows are public in the repository. It's still a young project, and I'd welcome reports of problems on hardware I don't have. Links - Source, documentation and screenshots - Docker Hub and Compose quick start - Synology installation guide - Desktop and Android TV downloads - Backup and restore I'd especially appreciate feedback on NAS resource usage, organizing existing libraries, Jellyfin/Emby integration and Android TV usability. The app includes no media or preconfigured content sources. Use only sources and accounts you have the right to access. It's independent of Stremio and isn't affiliated with Smart Code Ltd. It has its own accounts and doesn't sync with an official Stremio account. Screenshots from the GitHub README: Home, local library, title detail, download queue and Android TV. They show open movies and public-domain films; metadata and cast images come from TMDB. preview.redd.it preview.redd.it preview.redd.it preview.redd.it preview.redd.it

  20. Redditu/c_underw · r/herdr · 2 points

    Driverr v1.0.0 released on the App Store A couple weeks ago I posted about Driverr, an app I was working on for interfacing with Herdr from your phone. v1.0.0 was just released on the app store. v1.1.0 is currently in TestFlight and being reviewed that adds support for the new herdr-app and herdr-core. I would love feedback and PRs! Links: Appstore TestFlight Github

  21. X@cutiepieyv · 114 views

    PUMPFUN JUST ADDED QUANTUM PROOF SECURITY?? we can finally send QUANTUM INU W PUMP PAIR AND QUANTUM STOCKS NO PAIRS WENT 6MIL github.com/pump-fun/pump-fun-skills/commit/cd0b46… t.co

  22. X@arunimastwt · 1 like · 18 views

    Try it on your own agent: pip install invaris-agentsec agentsec init agentsec test Then tell me what it found, or what broke. invarislabs/invaris-agentsec

  23. YouTubeErick Batista Prado · YouTube description · 4 likes · 88 views

    Eitr: A Norse-Themed Arch Linux #shorts #arch #developer #hyprland #linux #nordic #opensource A quick tour of Eitr, a free Arch Linux distribution built around Hyprland and a custom Quickshell desktop, with a Norse soul. In this video: • The Eitr lockscreen: every key you type carves a rune • Native panels for hardware, WiFi, and the Control Center • Walker: one launcher for apps, settings, and actions • The theme picker: switching live to Afterglow recolors the bar, terminals, editors, and wallpaper together • LazyVim, About, and falling runes in the terminal • VS Code and the desktop bar moving between screen edges • The calendar and the workspace Overview Download (free): eitr.info Source code: eitr-org/eitr Handbook: eitr.info 🎵 **Music Credits** Music: *Secunda - Skyrim Lofi* (℗ 2023 bits & hits, released 2023-06-02) Artist and producer: bits & hits Composer: Jeremy Soule (The Elder Scrolls V: Skyrim) youtube.com All music rights belong to their respective owners. #linux #arch #archlinux #hyprland #ricing #opensource #developer #development #programmer #nordic #norsemythology

  24. X@benny1388 · 15 views

    @artvepa Yes: free-claude-code#2235. I asked for a response header, or a field outside the message text, that names the provider that served the request. The maintainer's first reply was that text in the message would enter the model's context; I answered that a header would not. No answer yet to that.

  25. X@howtopam · 39 views

    AikaOS - An Arch-based KDE Plasma live system with an Aika identity. An Arch-based KDE Plasma live system with Aika artwork, custom GRUB, and Fastfetch. Official beta sources and releases. emiliaplays/AikaOS t.co

  26. X@cyy7025219 · 2 likes · 118 views

    @vista8 感谢乔木分享!我做了个 Mac 端配套小工具:拖入 Markdown,自动转 EPUB,通过 Wi-Fi 发到 Kindle。支持 Obsidian 图片、提示块和嵌入笔记,换网可自动寻找设备。首次配对后,日常直接用 App,不用终端或 AI。需要已越狱并安装 KOReader,代码和配置教程已开源👇 chasepal/kindle-push-macos t.co

  27. X@simonschubert · 1 like · 25 views

    @mark_s I would love to and looked into it before hermes-agent#122032 this would make it a bit easier: install.sh fails under PRoot, where uv can't create hard links

  28. The Board Is the Only Benchmark: 72 Hours of Speed Demon 2026 Team ttimesai on four tracks in zero-dependency Rust: hashes instead of byte compares, memory you pay for without noticing, profiling through a file name, and a bug that showed up in 12 runs out of 30. Speed Demon 2026, run by Hackathon Raptors, gave teams 72 hours (30 October 15:00 UTC to 2 November 15:00 UTC) to beat naive Python references on four tracks: A · Ingest (aggregate 3.1M log lines into per-endpoint, per-hour percentiles), B · Index (50,000 boolean and phrase queries over a 250 MB corpus), C · Join (parse a hostile multi-megabyte CSV and join it against regions), and D · Traverse (2,000 shortest-path queries on a 5M-edge weighted graph). The speed score per track is 50 · log10(K), where K is the product of four ratios against the reference, with exponents for wall time (0.50), peak memory (0.20), source lines (0.15) and dependencies (0.15); the "points" below are this speed score, and the track total adds the judged parts on top. The live board runs every push once on a 12-thread i5-13500 with turbo off. Our repo: **ttimesai-star/speed-demon** (public from 2 November, after code freeze). Every number below comes from the board's own runs or from the PERF.md logs in that repo. Board results are from the public board on 31 October; the final scoring (five runs of the frozen commit on a hidden seed, on a machine with no other load) is run by the organisers and published with the winners on 13 November, after this post, so it is not in here. How the code was written. Plainly: the code was written by Claude Code, Anthropic's AI coding assistant, in long sessions, and a human on the team set the goals and the rules. The assistant also read the board results, decided which experiments to run, and wrote this post from the repo logs. The rules it worked under were: check output hashes before every push, keep at least 15 minutes between pushes, trust only the board for speed and memory, and log failures as well as wins. Rule 06 of the hackathon allows this ("we do not gatekeep on how the code was produced"), and every track README says it. Rule 06 also asks that PERF.md shows a human understood what happened; the log in the repo is the evidence for that, and you can judge it. Every figure below was checked against the repo logs. Where we ended up (public board, 31 October) | Track | First scored run | Best board run | T, s | M, MB | Source lines | Points | Place | |---|---|---|---|---|---|---|---| | A · Ingest | 0.132 s, 730.7 MB, 50.30 pts | run-da36d3a4aa55 | 0.0292 | 27.2 | 216 | 80.84 | 6 / 86 | | C · Join | 0.140 s, 21.7 MB, 59.76 pts | run-ea8e26ca4156 | 0.0403 | 10.3 | 258 | 76.55 | 5 / 74 | | D · Traverse | 0.909 s, 234.8 MB, 49.16 pts | run-d27164d64d22 | 0.1757 | 79.3 | 439 | 68.36 | 6 / 76 | | B · Index | 1.296 s, 232.5 MB, 46.52 pts | — | 0.4310 | 150.3 | 577 | 58.55 | 30 / 65 | Our three best tracks summed to 225.8, and the board's overall ranking, which counts the best three tracks, had us 5th of 99 teams on 31 October. For scale, the reference takes 32.05 s on track A. The final scoring is the organisers' and comes later, as noted above. 1. You cannot benchmark this on your laptop The first scored run of track A was the lesson that shaped the rest of the weekend. On our 2-vCPU CI runner the program peaked at 18.5 MB. The board measured 730.7 MB and 0.132 s (run-299ca5c2b1ad). The cause was our own reservations: 12 threads × 72 hours × a "worst-case" vector. Our best explanation is that the board machine has transparent huge pages on and backed those reservations with 2 MB pages. Every touched huge page counted in full, and zeroing them ate most of the wall time. We could not reproduce the exact 730 MB in CI (with THP=always and 12 forced threads we got 55.5 MB), so that part is inference, not proof. The fix was to reserve for the mean hour and opt out of THP at start. Later we also pinned glibc's mmap threshold: unsafe { prctl(41, 1u64, 0u64, 0u64, 0u64) }; // PR_SET_THP_DISABLE: small vectors, no 2 MB pages unsafe { mallopt(-3, 1 << 16) }; // M_MMAP_THRESHOLD fixed at 64 KB: a freed hour's records leave M at once The first line took A from 0.132 s / 730.7 MB to 0.0340 s / 29.8 MB in one push (run-ffe31d35df4b). The second line is subtler. glibc raises its mmap threshold after each large free, so the per-hour buffers we freed during output stayed in the arena and in peak memory. With the threshold fixed, M dropped from 29.0 to 26.8 MB at the same T (run-2e4a68da0bef). Track D got the same line later. Our two test machines disagreed with the board in both directions: - Track D, hash tables instead of dense label arrays: CI was 4 % slower, the board 2.2× slower (run-a741c2a56a3e). Reverted. - Track B, a Bloom filter in front of the dictionary: PC −20 %, CI +2 %, board no change (run-9aa73a6479ad). Reverted. - Track B, PGO: board 0.6456 s against 0.6115 s without it (run-a6a09a082994). Reverted. - Track C, 32-byte inline name slots: slower on our PC, whose 96 MB L3 holds everything, and faster on the board's 24 MB L3 (run-20344632fbda, kept). From ~20:50 UTC on day one we also had no CI: the private repo had used up its GitHub Actions minutes on A/B runs. From then on we checked correctness on a Windows PC build of the same logic and measured speed and memory only on the board. 2. Profiling a machine you can't log into We needed phase timings from the board itself, but it only reports T, M and a short public failure string. So a profiling build writes its timings into the name of an extra empty file in /out: let t0 = std::time::Instant::now(); let us = || t0.elapsed().as_micros(); // ... at the end of main: let name = format!("A_nt{nt}_l{tl}_b{tp}_s{}-{}_e{}-{}-{}_j{tj}_g{tg}_w{tw}_f{}-{}-{}_x{}", st[0], st[nt - 1], en[0], en[nt / 2], en[nt - 1], fin[0], fin[nt / 2], fin[nt - 1], us()); fs::write(format!("{dout}/{name}"), b"").unwrap(); The run then fails on purpose ("/out must hold exactly …, found […]"). That failure text is public on the board, and T is still recorded. We checked separately on the PC that the real output was correct. These runs were measurements only and never counted toward a best score. The first profile of A (run-5db9c3f80e78) showed: parse ends at 19.3 / 19.6 / 19.9 ms (first / median / last thread), output workers finish around 29.9 ms, and main returns at 29.97 ms of a 33.5 ms T. ~3.5 ms was process start and exit, mostly unmapping the 239 MB input in one thread. So each parse thread now drops its own pages as soon as it finishes: // MADV_DONTNEED on the whole pages of d[a..b]: unmapped here in parallel, not at the exit in one thread let (p, e) = (a.next_multiple_of(4096).min(b), b / 4096 * 4096); unsafe { madvise(d.as_ptr().add(p.min(e)), e - p.min(e), 4) }; A control push without it ran 0.0356 s, against 0.0329 s with it (run-8c3d925f7fbd and run-3a49e8d76354), so it is worth about 2.5 ms. That is about 7 % of the program, for code that computes nothing. The same trick works for ablations. On track C we pushed a build that skips setting the per-country bitset bits. The output is wrong on purpose, but the run is timed: T 0.0523 s, M 9.8 MB (run-138c8acedbb3). So the bitset costs about a tenth of T and 3.7 MB. That is less than per-thread buffers would cost in memory points, so it stayed. 3. The biggest single lever: stop comparing key bytes The largest single jump of the second day came from one idea on two tracks. Identify a key by a 64-bit hash and never compare its bytes. On C, a perf profile of the first version had 23 % of the time in bcmp, comparing each name with its first occurrence at a random spot in a 202 MB mapping. Inline slots and arenas helped. Then we dropped the bytes entirely: // Dense id of the name with hash h, shared by all threads. A slot holds the low 44 bits of h << 20 | id and its // index is the top 17 bits of h, so names count as equal when all 61 bits match: with 100,000 names the chance // that any two do is about 100,000^2 / 2^62, below 10^-8. An 8-byte slot per name keeps the table at 1 MB. fn name_id(t: &[AtomicU64], h: u64) -> u64 { let (mut i, tag) = ((h >> 47) as usize, h & (1 << 44) - 1); loop { let mut v = t[i].load(Acquire); if v == 0 { let id = TOP.fetch_add(1, Relaxed); match t[i].compare_exchange(0, tag << 20 | id, Release, Acquire) { Ok(_) => return id, Err(w) => v = w, } } if v >> 20 == tag { return v & 0xFFFFF; } i = (i + 1) & (SLOTS - 1); } } No more random reads into the input to compare bytes, and the table shrank from 4 MB to 1 MB. Our profile had already shown C running 3.3× slower per thread on the board than on our PC, which we put down to cache misses on tables of ~9 MB. T went from 0.0481 to 0.0416 s, M from 13.4 to 10.5 MB: +2.7 points in one push (run-c21f5e3b4e84). On A the same change for endpoints gave 0.0294 s and +0.6 points (run-3b77efb47584). There, two of the 1,842 templates collide with a probability below 10⁻¹². This trades exactness for a stated, tiny probability, and we documented the bound in PERF.md and the README. Every local dataset (published hashes plus the organisers' reference run on extra seeds) still matched byte for byte. 4. The bug that full-size runs never showed That name_id function had a bug. The empty name hashes to 0. If it happened to be the first name inserted, it got id 0, and its slot then held exactly 0, which reads as "empty". The next empty name would claim a fresh id. Whether this happened depended on which thread got to the table first, so the output depended on thread timing. Five runs of the full dataset all passed, and so did the board. The spec's tiny worked example, run 30 times, was wrong 12 times. On full data we estimated about one run in a hundred would fail. The final score is five runs on a hidden seed, so this could have cost us the whole track. The fix was one character: -static TOP: AtomicU64 = AtomicU64::new(0); // names (a lost race for a slot leaves an unused id) +static TOP: AtomicU64 = AtomicU64::new(1); // names from 1, so no slot is 0 (the empty name hashes to 0); a lost race leaves an unused id After the fix: 60/60 worked-example runs, 30/30 tiny, 20/20 sample, and all ten datasets matched the reference (commit ebb2a44). From then on every candidate version went through 30 repeated runs of each small dataset, not only the big ones. Small inputs make rare orderings likely. Big inputs hide them. 5. Memory on the graph track: 279 MB to 79 MB Track D started at 279 MB peak. That was mostly 12 threads × dense label arrays plus a graph stored as 8-byte edges. The leaders were at 70–110 MB. The steps that got us there: - Free early. The parsed edge buckets are freed right after the first CSR, and the reverse CSR is built inside the old edge array: M 279 → 139 MB (run-783c571ed206). - Paged labels. Each thread keeps a pool of small pages of [u32; 2] labels instead of n labels per thread. - Pack the edges into 4 bytes. At full scale a node id needs 21 bits, which leaves 11 for the weight, and 99.93 % of weights fit: // A search graph: offsets, edges as head | weight << .3 (the head takes .3 bits; a weight that does not fit // leaves the field's top value and is kept exact in .2, sorted by edge position). Weights are mostly below // 2^11 and n is below 2^21 at full scale, so an edge is 4 bytes instead of 8. struct G(Vec<u32>, Vec<u32>, Vec<(u32, u32)>, u32); That cut M from 137 to 90 MB at the same T (run-a4daf0dfb2bb). A radix heap, prefetches in the BFS renumbering, and running queries in order of their source's new id brought T from 0.194 to 0.176 s. Final: 0.1757 s, 79.3 MB (run-d27164d64d22). 6. Where track B stalled Track B never caught up: 0.43 s against about 0.27 s for the track leader on the night of 30 October. The cost sat in tokenizing and dictionary lookups. Only memory responded: the peak was held by 75,000 small allocations and per-thread term streams. One shared list buffer, u16 term ranks in the streams, and dropping the 75,000 offset vectors took M from 185 to 154 MB, and a later step reached 150 MB. B stayed out of our best three. 7. Noise: ±5–10 % on unchanged code Track A ran anywhere from 0.029 to 0.041 s on identical code across the day. One push of a compacted track C read 0.0651 s; the same code pushed again read 0.0481 s. A D outlier of 0.1922 s re-measured at 0.1778 s. What we did about it: - Control in every push. The board re-runs every track on each push, and track B was unchanged for the whole second day, so its time showed how fast the board was in that hour. When an unchanged track ran 12 % slow in the same push as an experiment, we did not trust that push's verdict either way. - Compare within one push, never across hours. - Re-measure anything under ~5 % before believing it. Several "wins" were noise: prefetchw and an AVX2 byte search on C, and a compact key arena on A, all ended up inside the spread of unchanged code. - Pick finals by mean, not best. The board keeps your best run, but the final scoring takes five runs of the frozen commit on a hidden seed on a quiet machine. So pushing the same code again for a luckier number buys nothing. We chose final versions by the average of several board runs (A ≈ 0.0303 s, C ≈ 0.041 s, D ≈ 0.177 s). 8. Source lines are points too S has a weight of 0.15, counted after rustfmt. Rewriting the same algorithm more compactly took C from 368 to 288 lines and D from 429 to 363, worth +0.5 to +0.8 points with no change in speed. The other side: 30 extra lines cost about as many points as 2–3 % of T, so a small speed tweak can lose more than it wins. We counted lines with the board's formatter rules before every push. What we would tell the next team 1. Get on the board in the first hour with something trivial. Our CI numbers predicted little about the board. 2. Build a profiling channel into the board (a file name, an exit code, anything public) before optimising. 3. Make serial work your first target. With 12 threads waiting, a one-thread sort of 200k country codes cost track C about a quarter of its time. 4. Hash identities beat byte compares, if you state the collision bound and check every dataset you have. 5. Repeat small inputs many times. Our worst bug lived in a 30-run test, not in a 3-million-line one. 6. Log the failures. Dozens of our PERF.md entries are reverted or not-taken experiments, and they taught us more than the wins. The code, every PERF.md row with its board run ID, and the reverted experiments are in the repo: **ttimesai-star/speed-demon**. Thanks to Hackathon Raptors for a board that told the truth, even when we didn't want to hear it.

  29. X@PumpfunClaims · 273 views

    New Claim Report: github.com/realnatalie just claimed 1.4 SOL for $Trench Cafe on @Pumpfun pump.fun

  30. 💡 Why can’t values defined inside an `if` or `while` condition block be visible in the body, just like in `for`? That might change if this new SIP goes through, and I really hope it does! 🤞 github.com/mberndt123/improvement-proposals/blob/…

  31. V2EX@healthyhome36 · 分享创造

    做了一个宝可梦开包模拟器,顺便把每个系列的抽卡概率整理成了公开数据集 说一下我最近在做的东西,主要是想听点真实反馈。 做了什么:pullsim.com------------- 一个英文的宝可梦 TCG 开包模拟器,可以免费开各个系列的包。跟同类站的区别是我把重点放在抽卡率数据上:每个系列按稀有度拆开,标出来自多少包样本,另外单独做了一个 /how-we-calculate/ 页面,把统计口径写清楚——怎么算一张,怎么处理保底位,样本怎么收集。 为什么折腾这个? 市面上很多模拟器的概率是估的,或者干脆不写来源。我自己开包的时候想找一个能对得上公开统计的地方,找不到,就自己做了一个。做的时候给自己定了一条:每个数字都要能说清样本从哪来。数据我整理成 CSV 放到了 GitHub 和 Hugging Face ,想让别人验证或者拿去用都行。 踩到的几个坑(可能对做类似站的人有用): 1.系列映射比想象中麻烦:同一张卡在不同系列、不同语言版本里编号规则不一样,跨系列统计时得先建一套自己的映射,不然算出来的概率是错的。 2.样本量不够时数字会离谱:小系列样本少,稀有卡一张就能让概率翻几倍,得标注置信区间或者干脆写“样本不足”。 3.英文站的收录很慢:站是面向美国用户的,上线后索引和曝光都要等,这块我还在摸。 想请教的几个问题: 1.模拟类工具站,你觉得用户更在意“开包爽”,还是更在意“数据准”?我现在的重心压在数据上,不太确定方向对不对。 2.这类纯前端模拟的站,有没有什么性能或体验上的坑是我没考虑到的? 网站: pullsim.com 数据: zin294/pullsim-pull-rates

  32. The code for this public sandbox is available at synqronlabs/mxraven-demo. One interesting thing which sets us apart is used for the CLI: a durable NATS JetStream consumer over websockets for clients to fetch all events (delivery attempts, side effects from rules and their actions etc). I built perch synqronlabs/perch, a tiny, single-binary mailbox server backed by mxRaven which can run behind CGNATs and firewalls on consumer devices effortlessly using this. If you wanna check out what the mxRaven resources the sandbox uses (the listeners for instance) on the dashboard, use the credentials: Username: guest Password: c53A!@3qaMzM in the workspace 'kush' on app.mxraven.com in the 'Open Workspace' option.

  33. Redditu/SerpentineDex · r/PolyendTracker · 108 points · 48 comments

    Tracker. The Biggest Update Yet. I've been teasing this for a bit now. Here it is! polyend/tracker-ce Full changelog can be found here: github.com/polyend/tracker-ce/blob/main/CHANGELOG…

  34. Redditu/jaavilac · r/StrixHalo · 4 points · 5 comments

    Qwen3.8-Flash-Next, Gufo-win v0.5.0: cached follow-up turns 3-5x faster (21 ms first token at 32K), 99.8 tok/s MTP decode at 32K, still 1,508 tok/s prefill at 256K (Bosgame M5 - Windows 11) Hi, here my updated version of my repo: Gufo-win v0.5.0 for Windows on Strix Halo (gfx1151). The headline change is the cache path: follow-up requests in the same session now reuse resident K/V rows and memoize tokenization, so the first cached token arrives in 21-23 ms at 32K context (was 57-66 ms in v0.4.0) and 27-30 ms at 100K (was 152-170 ms). For comparison, Bubo 0.1.1 measured 8.6-9.0 ms at 32K but 102-113 ms at 100K on the same machine and prompt. Measured (v0.4.0 vs v0.5.0) (same machine, same weights, direct gufo bench, greedy, two repetitions, one process at a time, UD-Q4_K_XL + MTP Q8_0): |Context|AR decode|MTP decode|MTP accepted|Prefill| |:-|:-|:-|:-|:-| |8,192|32.15 → 33.71 (+5%)|50.08 → 51.94 (+4%)|66%|1,678 → 1,708| |32,768|32.15 → 32.07 (0%)|97.15 → 99.82 (+3%)|100%|1,636 → 1,648| |131,072|29.44 → 29.32 (0%)|92.44 → 94.43 (+2%)|100%|1,570 → 1,579| |262,144|27.35 → 27.35 (0%)|87.94 → 90.03 (+2%)|100%|1,503 → 1,508| Also in: autoregressive decode vs the llama.cpp reference on the same machine went from +21.8% to +29.0% at zero depth, MTP chains now end at the first unconfident draft (llama.cpp #882), the fused GDN prefill kernel (#895) and packed-dequant/bf16 WMMA fixes are imported, and the v0.4.0 tool-calling regression is fixed (fenced tool-call literals leaking into content, plus logit_bias support). Repo: jaacMusic/gufo-win Release: github.com/jaacMusic/gufo-win/releases/tag/v0.5.0 Enjoy!

  35. Sex machine 2~ Made using: FP-Studio/framepack-studio LoRA: civitai.red My models and art are free, so I appreciate your support! Find more here: civitai.red #nsfw #aiart #hunyuanvideo #civitai #sexmachine #framepack #framepackstudio

  36. Bluesky@silentstars.dev · 4 likes · 2 reposts

    🙌 Community pick vscode-audiolens — Audio inspection & analysis extension for Visual Studio Code #indiedev #opensource #typescript #audio #audioprocessing 📮 Submit yours →

  37. X@cnre · 11 views

    开源宝藏:Handy 按住快捷键说话 松开,文字就贴进输入框 全程在自己电脑上跑 不联网、不注册、不花钱 Mac、Windows、Linux 都能用 写稿、记笔记、手累的人,试试 自回复:仓库 cjpais/Handy%EF%BC%8C%E8%BF%91 3 万 stars;Mac 用 brew install --cask handy,Windows 用 winget install cjpais.Handy

  38. Redditu/SerpentineDex · r/Polyend · 58 points · 31 comments

    Tracker. The Biggest Update Yet. I've been teasing this for a bit now. Here it is! polyend/tracker-ce Full changelog can be found here: github.com/polyend/tracker-ce/blob/main/CHANGELOG…

  39. X@RM16707215 · 15 views

    billy1204/Onn-RGB With AppImage for Linux t.co

  40. Redditu/Emergency-Tutor-7 · r/bioinformaticstools · 1 point

    axiomize: ODE/DAE model export to SBML L3V2 and CellML 2.0 that refuses instead of guessing your units I wrote this. MIT, free, no paid version, Python 3.10+. It is a general scientific modeling engine, so let me be specific about the one part that might matter to this sub. Models are held in a versioned Model IR where every variable and parameter carries an explicit unit. Export writes standard formats from that IR: SBML Level 3 Version 2 Core. Each model becomes one compartment (default_compartment, constant, size 1), state variables become species with initialConcentration when an initial value exists, parameters become constant global parameters, and the equation system becomes a listOfRules: a rateRule for each derivative equation in an ODE family, an algebraicRule for everything else. There is no listOfReactions, so if your workflow needs a reaction-network encoding with kinetic laws, this is not that. Units are preserved verbatim inside an axiomize annotation; free-form units that have no clean SBML unit definition are not invented to make the document look complete. Schema validation reports NOT_RUN unless python-libsbml is installed, in which case the document is actually parsed with libsbml and its errors are returned. Structural checks only otherwise, and the tool says which one ran. CellML 2.0. This one is deliberately fail-closed. If any unit in the model cannot be mapped to a CellML unit name, the export returns status ADAPTER_REQUIRED with the list of unsupported units and the portable IR, and writes no XML. It will not silently reinterpret µM as something convenient. Modelica 3.6 textual export exists for ODE, DAE and algebraic model families. It also refuses rather than improvising: a parameter with no concrete value, or an equation kind with no conservative mapping, returns ADAPTER_REQUIRED. Syntax generation is checked; compiler validation is reported as NOT_RUN because there is no Modelica compiler in the test path. Other export targets from the same IR: JSON, a rerunnable Python script, YAML, an nbformat 4 notebook, GraphML for network-family models, causal DOT, and a portable bundle that carries a SHA-256 over the canonical IR. You reach it as a library, a CLI (axiomize model --action export --input-json request.json) or an MCP server. Two things I got pushback on elsewhere and hardened: unversioned sbml and cellml aliases return ADAPTER_REQUIRED rather than guessing which schema version you meant, and yaml reports TOOL_UNAVAILABLE when PyYAML is missing instead of half-emitting something. What it does not do: it is not a solver replacement, not a pathway database, and the export is a translation of your equations, not a biological interpretation of them. Nothing here knows whether your compartment scheme is physiologically sensible. Repo: Furox-Art/axiomize (1.14.2) If you have a real SBML consumer, the useful feedback is whether the rule-based encoding loads in COPASI or libsbml tools you already trust. I can validate structure and optional libsbml parsing, and that is narrower than "interoperable with everything".

  41. Redditu/Scary-Marketing-7461 · r/ErgoMechKeyboards · 129 points · 4 comments

    Tako update — added a Cirque trackpad to my 34-key split EC build A little update to the Tako build I shared here previously: it now has a Cirque trackpad! This is still the same 34-key split electrocapacitive keyboard with my TakoNest case, now with a trackpad mounted on the inner side of the right half. The left half keeps its nice!view display. For the ZMK trackpad integration, I’m using nxtkb’s cirque-input-module. I also had Codex help me design a small adapter PCB to connect the trackpad over I²C through the keyboard’s existing 5-pin nice!view connector. It’s been fun taking this build a little further, from designing the case to adding a pointing device. Huge thanks again to ssbb for the original Tako project, and to nxtkb for the Cirque module! Previous post · TakoNest case files Would love to hear your thoughts on the trackpad placement, especially from anyone using a similar thumb-operated setup.

  42. Sex machine~ Made using: FP-Studio/framepack-studio LoRA: civitai.red My models and art are free, so I appreciate your support! Find more here: civitai.red #nsfw #aiart #hunyuanvideo #civitai #sexmachine #framepack #framepackstudio

  43. X@alpefe_me · 25 views

    Por si tenéis una impresora termica del mismo palo y no quereis usar la app llena de spyware. Es Bluetooth BLE asi que necesita bluetooth el host para comunicarse, quizas se puede hacer RE del ISO 15740 aunque ni idea si lo usa. AlPeFe/x5h-printer

  44. X@Manorgw · 2 likes · 1 repost · 1,585 views

    想不花钱看全球电视?开源项目 Free-TV/IPTV 可以试一把。 它把全球免费频道归整成 M3U 播放列表,各地电视台都在里头,Pluto、Samsung TV Plus、YouTube Live 这类公开直播源也收了进去。讲究的是少而精,尽量把画质和可用性稳住,付费源和失效链接能少则少。 🔗 项目地址:Free-TV/IPTV t.co

  45. Qiita@nexus-tools · 1 like

    AIに振込データを作らせると「株式会社」と小さい「ッ」で弾かれる問題を、振込名義の整形ツールで止める <!-- tags: Python, MCP, AIエージェント, 経理, 全銀 --> 困りごと 総合振込や給与振込のデータをAIに作らせると、名義を「半角カナにしただけ」で返してきがちです。 株式会社 ニッポンショウジ → カブシキガイシャ ニッポンショウジ (AIがよく返す形) → カ)ニツポンシヨウジ (銀行で通る形) 振込名義に使える文字は決まっています。ある証券会社の公開ページ( gaitame.com )によると、数字・英大文字・カナ46字・濁点と半濁点・記号9種・半角スペースだけ。小さいカナは大きく、「・」はピリオド、「ー」はハイフンにします。株式会社などは法人略語にして、位置でかっこが変わります(先頭 カ)、途中 (カ)、末尾 (カ)。30文字を超えると振込できない場合もあります。 違うとデータが止まります。会計ソフトのFAQにも「振込依頼人名に使用できない文字が含まれています。」という実例があります( biz.moneyforward.com )。 作ったもの JP Zengin Name(MIT・Python標準ライブラリのみ・外部通信なし)。 ayatrader/jp-zengin-name MCPサーバー・コマンド・Pythonの関数・Agent Skill(SKILL.md)で使えます。 python -m zenginname "ガイタメドットコム株式会社 オキナワシシャ" ガイタメドツトコム(カ)オキナワシシヤ - 法人・営業所・事業の略語59件(株式会社・合同会社・医療法人・一般社団法人・特定非営利活動法人・営業所・健康保険組合 など)を位置の決まりつきで変換。「かぶしきがいしゃ」と読みで書いても変換します - 字数は振込データと同じ数え方(「ガ」は ガ で2文字) - 法人の種類以外の漢字は読みを推測しません。E_KANJI_NEEDS_READING で、どの字の読みが要るかを返します - 入金消込用に、通帳の名義(カ)サクラ)と取引先名(サクラ株式会社)が同じかを比べます。ユ) と株式会社のように種類が違うときは別に知らせます 判定テスト集 data/zengin_name_cases_v1.jsonl に30問(先頭・途中・末尾、読みで書いた法人名、小さいカナ、全角英数字、ヴ、ヰ、分かれた濁点など)。 python -m zenginname.bench {"jp_zengin_name": "30/30", "naive": "2/30"} 「NFKC → カタカナ → 半角」だけの素朴な変換は2/30でした。ただし、問題と決まりは同じ人(NEXUS)が書いたので、30/30は公開された決まりと矛盾しないことを示すだけで、実際の銀行データでの正しさの証明ではありません。 できないこと - 漢字の読みは出しません(読みは本人や台帳から) - 字数の上限や一部の記号は銀行で違います。元の表で空欄(結合セル)の行(医療法人社団・公益財団法人 など)は上の行の略語を使い、W_MERGED_ROW で注意を出します - 名義だけを扱います。口座番号・銀行コード・お金は扱いません 誤判定した名義(架空の値で)を Issue で教えてもらえると、テストに足します。

  46. X@justwasm · 13 views

    @grok 你确定?事实核查,这似乎是个第三方 wrapper 拓展 shubzkothekar/antigravity-acp

  47. X@krishdotdev · 11 likes · 2,344 views

    Vibe designers, thank me later. Nutlope/hallmark

  48. X@polytutor · 15 views

    Revisited 13/39: Cross-Market lead-lag. Use a related market or feed as the signal, trade the one that lags. Test it by logging how often the gap closes before your fill lands. Main failure: correlation is not a contract, both legs can lose. Not advice. github.com/Polytutor-AI-Labs/polymarket-strategy-… t.co

  49. Redditu/EconomistCheap7581 · r/StremioAddons · 14 points · 9 comments

    Stremio Offline: a self-hosted client for Stremio addons and your NAS library — Docker, desktop and Android TV Hi all, I'd like to share Stremio Offline, a free, open-source hobby project I've been building for my own household, with substantial help from AI. I wanted to use standard Stremio addons from a server on my NAS, keep my own local media library, and watch from different devices without leaving a desktop computer running. It's an independent client with its own server and accounts; it doesn't connect to or sync your official Stremio account. What it does today - Stremio addon support: catalogs, streams and subtitles, with one search across your addons, local libraries and connected Jellyfin/Emby libraries. - Persistent downloads: a queue that survives restarts, resumes partial files and pauses when the disk is full. You can prepare a season or a whole show before adding it, with rules for quality, size, audio and subtitle languages. - Following: a release calendar and optional automatic episode downloads, including keeping a few episodes ready ahead of where you're watching. - Your existing media: multiple library folders, automatic identification, artwork, favorites and continue watching. A free TMDB API key improves metadata and artwork. - A personal Home page: each account can arrange its rows. Title details show ratings, cast and crew, trailers, similar titles and the source that will play. - Playback that tries to spare the NAS: direct play first, remux if possible, and hardware transcoding when needed and available, including Intel QuickSync on compatible Synology models. Chapters, intro/recap/credits skipping and an adjustable Up next point are available; segment lookup depends on IntroDB and is off in secure mode. - Household accounts: per-user access to libraries and addons, with separate favorites and viewing progress. - Jellyfin and Emby: browse and play their libraries through the same interface. Remote media stays read-only and viewing history is kept locally in Stremio Offline. Where it runs Docker is the main target, with images for amd64 and arm64 and a Synology Container Manager guide. There are also macOS Apple Silicon, Windows x64 and Linux x64 desktop apps, plus a native Android TV client. Phones and tablets use the browser. The web and desktop interface has ten languages. The desktop apps can run their own local server or connect to your NAS. They're unsigned, so the install guides explain the first-launch prompts. The Android TV app connects to an existing server. Streams, subtitles and downloads pass through the backend. Secure mode also proxies artwork; with it off, artwork can load directly from providers. For access away from home, use a VPN or an HTTPS reverse proxy rather than exposing the plain HTTP port. Links - Source and documentation (MIT) - Docker Hub, with a ready-to-use Compose example - Desktop and Android TV releases - Synology installation guide I'd appreciate feedback from people trying it on their own hardware, especially NAS playback, Android TV navigation and the install experience. This is an unofficial project, not affiliated with Stremio or Smart Code Ltd. It includes no media or preconfigured content sources. Use only sources and accounts you have the right to access. The screenshots below are from the GitHub README and show open movies and public-domain films; metadata and cast images come from TMDB. Screenshots: Home, film detail, series detail, download queue and Android TV. preview.redd.it preview.redd.it preview.redd.it preview.redd.it preview.redd.it

Older posts →