Wikihack: Turning Wikipedia Discussions on Hacker News into a Scrollable Feed

Wikihack reorders Wikipedia mentions on HN into a scrollable feed with three browsing modes.
Wikihack is a weekend project inspired by HackerTube and Hackerbooks that scrapes all Wikipedia articles mentioned on Hacker News, reorders them, and turns them into a scrollable feed. The site offers three browsing modes: Top shows the most frequently linked articles, Random uses weighted randomness biased toward high-frequency entries, and Rising focuses on the past 12 months. A key design is preserving source backlinks so users can see where an article was submitted and in which comments it was mentioned, restoring discussion context. The entire site is served purely from the frontend, likely using a static site architecture—simple to deploy but with update frequency limited by the build process. The author says more features will be added if feedback is positive. The Show HN post received 197 points and 56 comments, showing community interest in this kind of "new view" tool.
From HackerTube to Wikihack: A Weekend Project Born from Inspiration
Following in the footsteps of Karpathy's HackerTube and Hackerbooks, a developer has launched Wikihack—a project that scrapes all Wikipedia articles mentioned on Hacker News, reorders them, and turns them into a scrollable feed. The motivation is straightforward: discussions about Wikipedia on HN are scattered across submissions and comments, making them hard to digest. Wikihack aims to make this content easier to browse and engage with.
According to the author's Show HN post on Hacker News, the entire site is served purely from the frontend with no backend logic at present. If user feedback is positive, the author says they will continue adding features.
Show HN is a section on Hacker News specifically for showcasing personal projects, where users post products they are developing and receive feedback. HackerTube and Hackerbooks are similar projects previously created by different developers—the former aggregates YouTube videos mentioned on HN into a feed, while the latter focuses on book links. The common thread across these projects is: extract specific types of external links from HN submissions and comments, then reorganize and present them from a new angle. Wikihack follows this pattern but targets Wikipedia entries instead.
Core Mechanics: Three Browsing Modes
Top: Most Frequently Linked Articles
The homepage displays the most frequently linked Wikipedia articles. This amounts to an aggregation of knowledge points the HN community has long paid attention to—which entries have been repeatedly submitted and cited becomes immediately clear.
Random: Weighted Randomness
Random mode is not perfectly uniform but slightly biased toward frequently linked articles. The author's own analogy is that it's "kind of like Wikipedia itself"—popular entries are more likely to be encountered randomly, but obscure entries still have a chance at exposure. This design strikes a compromise between exploration and representativeness.
Weighted random is a method of drawing elements from a set where each element's probability of being selected is proportional to its weight. In Wikihack's case, the more frequently a Wikipedia article is linked, the greater its weight, and therefore the higher its probability of being drawn in Random mode. This differs from completely uniform randomness, which would give all entries equal probability and result in an excessively high proportion of obscure content. Weighted random ensures obscure entries still get exposure while keeping the overall distribution closer to the community's actual interests—which is why the author compares it to Wikipedia's own article traffic distribution.
Rising: Focused on the Past 12 Months
Rising mode sorts by a time window covering the past 12 months, designed to capture Wikipedia entries gaining traction in recent HN discussions. For readers who want to track the community's current interests, this mode is more timely than Top.
Interaction Design: Tracking Sources and Discussion Context
A key design decision in Wikihack is preserving context: you can see where an article was submitted and in which comments it was mentioned. This solves a common pain point—looking at a Wikipedia entry in isolation often leaves you wondering why it became popular on HN; linking back to specific submissions and comments restores the discussion context.
This "visible sources" approach makes the feed more than just content aggregation—it adds a layer of community discussion metadata. For researchers or content creators, this is more valuable than a simple leaderboard.
Trade-offs of a Pure Frontend Architecture
The author explicitly states that "the entire site is served only through the frontend." This means data scraping and sorting are likely done at build time, and the site itself is static. The advantages of this architecture are simple deployment, low cost, and fast loading; the disadvantages are that update frequency is limited by the build process, and personalized real-time interaction is not possible.
For a personal project, this is a reasonable starting point. The author has also left the door open: if community feedback is good, more features will be added.
A static site refers to a website where all pages are pre-generated at build time and served directly as static files after deployment, without requiring a server to dynamically generate content on each request. Wikihack's "served only through the frontend" means that data scraping, sorting, and page generation likely happen at the build stage, and when users visit, the browser directly loads the already-generated HTML, CSS, and JavaScript. This architecture is typically deployed on a CDN and offers advantages such as fast loading, low cost, and simple maintenance; however, each data update requires re-triggering the build process, and personalized rendering based on user identity or real-time requests is not possible.
Reception on Hacker News
The post received 197 points and 56 comments on Hacker News (as of scraping time), indicating that the idea of "turning Wikipedia mentions on HN into a feed" has resonated with a considerable number of readers. The discussion activity also confirms the replicability of the HackerTube-style project pattern—reorganizing a community's external link data can produce a new browsing experience.
Why This Kind of Project Is Worth Noticing
Hacker News generates a massive number of links and discussions every day, but the native interface is not good at "retroactive browsing by topic." What Wikihack does is not new data but a new view: reordering existing mentions, adding source backlinks, and offering browsing options across different time dimensions. For those interested in the intersection of AI and knowledge communities, this kind of lightweight tool demonstrates how simple frontend approaches can extract residual value from community data.
If you frequently read Wikipedia links on HN and can't find them later, Wikihack offers a way to rediscover them by popularity, randomness, or recency.
Related articles

9 AI Subscription Plans Compared: The Real Cost Per 100M Tokens Revealed
Bilibili creator tests 9 AI subscription plans from Volcano, Alibaba, Tencent, Baidu, Zhipu, Xiaomi, MiniMax and more, converting them all to real cost per 100M tokens, breaking down fixed-quota vs. three-tier coefficient billing and how caching, time-of-day discounts, and window limits affect actual quota.

Vibe Coding for Beginners: Expressing Intent Instead of Handwriting Code
What is Vibe Coding? A 137-episode Bilibili course defines it: the core is expressing intent, not writing code. This article analyzes Vibe Coding's productivity logic, target audience, and entry expectations to help beginners decide if it's worth learning.

LangChain Beginner's Guide: An Agent Development Roadmap from LangGraph to Deep Agents
Clarify the encapsulation relationship among LangChain, LangGraph, and Deep Agents, and master the learning path and selection logic for agent development frameworks—suitable for beginners in large model development.