SShortSingh.
TopTechnologyAI & MLStartupsProgrammingScienceBusinessFinanceCrypto & Web3World
Back to feed
Programming

Amoxi: Fast pages with very little JavaScript

0
·11 views

Amoxi is a web framework built on the idea that most pages are mostly static content, so it renders pages to plain HTML on the server. Only small interactive components, called islands, ship JavaScript to the browser. The article walks through adding a stats page to a notes app, with a live filter box, a slow streaming section, and links that load without a full page reload. Islands are written with signals, computed values, and keyed lists, and can be set to load immediately, when the browser is idle, or when scrolled into view. The example page's total JavaScript cost is under 6 kB, and the page still works with JavaScript disabled.

Read the full story at DEV Community

This is an AI-generated summary. ShortSingh links to the original source for the complete article.

Discussion (0)

Log in to join the discussion and vote.

Log in

Related stories

0
ProgrammingDEV Community ·

Why AI transcripts need an acceptance pipeline before anyone relies on them

A guide argues that automatic speech recognition can look convincing in demos while still failing in production on overlapping speech, noise, domain terms, names, and numbers. It recommends asking what evidence a transcript must provide before people or systems depend on it, rather than asking how accurate a model is in general. The author frames local processing versus managed APIs as a choice driven by the actual data flow, security posture, and operational capacity, not a generic privacy-versus-convenience trade-off. A comparison table lists the evidence each option requires, including data-flow diagrams, runbooks, regression suites, and deletion proof. The core principle is keeping audio, transcript, speaker structure, uncertainty, corrections, and downstream actions linked in one traceable record.

0 comments Read more at DEV Community
0
ProgrammingDEV Community ·

Developer details pgvector memory patterns for ByteDance's deer-flow long-running agents

A developer writing on DEV Community describes integrating ByteDance's deer-flow agent framework into a multi-hour autonomous research pipeline, where memory persistence proved harder than task orchestration. The framework separates agent memory into a session buffer, a vector store for semantic retrieval, and relational metadata such as timestamps and task lineage. The author shares a PostgreSQL and pgvector schema using an HNSW index, reporting that tuned settings cut insert latency from multi-second stalls to about 12ms at p99 under 500 concurrent inserts. Pure vector search surfaced tangential older memories over recent decisions, so the author fused vector similarity with recency and task-ancestry filters using reciprocal rank fusion.

0 comments Read more at DEV Community
0
ProgrammingDEV Community ·

Seven Nine Point Labs apps now run on most Linux distributions via AppImage

Nine Point Labs, whose apps were originally built for Omarchy, has released AppImage versions of seven of its desktop applications so they run on other Linux distributions such as Ubuntu, Fedora and openSUSE. The AppImages are included with today's releases of Repokase, Jubako, Dogear, omaforge, Rune, Bahá'í Reader and Hyprfall. Each AppImage bundles its own runtime dependencies and runs on systems with glibc 2.34 or newer, covering most distributions from about 2021 or 2022 onward. Users can make the file executable and optionally install a desktop entry for their application menu, and tools like Gear Lever and AppImageLauncher also support them. Bahá'í Reader additionally ships a Flatpak bundle, and Hyprfall now requires Quickshell 0.3 or newer, so Fedora's package was dropped in favor of the AppImage.

0 comments Read more at DEV Community
0
ProgrammingDEV Community ·

Indexing Podcast Transcripts in Postgres with Speaker-Turn Metadata

The article argues that podcast transcripts sent to a vector index should store speaker, start time, and episode ID with every chunk, and chunks should never span a speaker-turn boundary. This structure allows retrieval to attribute quotes accurately and gives players a precise timestamp to resume from. It also lets an ingest worker replace a single episode without affecting the rest of the corpus. The author treats chunking as an operational contract, warning that a correction must become searchable as one coherent generation. Turn-based chunking increases record counts, so teams must budget write volume, index size, and delete work accordingly.

0 comments Read more at DEV Community