<?xml version="1.0" encoding="utf-8"?>
<feed xml:lang="en-us" xmlns="http://www.w3.org/2005/Atom"><title>Simon Willison's Weblog: research</title><link href="http://simonwillison.net/" rel="alternate"/><link href="http://simonwillison.net/tags/research.atom" rel="self"/><id>http://simonwillison.net/</id><updated>2026-04-13T15:04:00+00:00</updated><author><name>Simon Willison</name></author><entry><title>Exploring the new `servo` crate</title><link href="https://simonwillison.net/2026/Apr/13/servo-crate-exploration/#atom-tag" rel="alternate"/><published>2026-04-13T15:04:00+00:00</published><updated>2026-04-13T15:04:00+00:00</updated><id>https://simonwillison.net/2026/Apr/13/servo-crate-exploration/#atom-tag</id><summary type="html">
    &lt;p&gt;&lt;strong&gt;Research:&lt;/strong&gt; &lt;a href="https://github.com/simonw/research/tree/main/servo-crate-exploration#readme"&gt;Exploring the new `servo` crate&lt;/a&gt;&lt;/p&gt;
    &lt;p&gt;In &lt;a href="https://servo.org/blog/2026/04/13/servo-0.1.0-release/"&gt;Servo is now available on crates.io&lt;/a&gt; the Servo team announced the initial release of the &lt;a href="https://crates.io/crates/servo"&gt;servo&lt;/a&gt; crate, which packages their browser engine as an embeddable library.&lt;/p&gt;
&lt;p&gt;I set Claude Code for web &lt;a href="https://github.com/simonw/research/pull/108"&gt;the task&lt;/a&gt; of figuring out what it can do, building a CLI tool for taking screenshots using it and working out if it could be compiled to WebAssembly.&lt;/p&gt;
&lt;p&gt;The &lt;code&gt;servo-shot&lt;/code&gt; Rust tool it built works pretty well:&lt;/p&gt;
&lt;pre&gt;&lt;code&gt;git clone https://github.com/simonw/research
cd research/servo-crate-exploration/servo-shot
cargo build
./target/debug/servo-shot https://news.ycombinator.com/
&lt;/code&gt;&lt;/pre&gt;
&lt;p&gt;Here's the result:&lt;/p&gt;
&lt;p&gt;&lt;img alt="An accurately rendered screenshot of the Hacker News homepage" src="https://static.simonwillison.net/static/2026/servo-hn.png" /&gt;&lt;/p&gt;
&lt;p&gt;Compiling Servo itself to WebAssembly is not feasible due to its heavy use of threads and dependencies like SpiderMonkey, but Claude did build me &lt;a href="https://simonw.github.io/research/servo-crate-exploration/html5ever-wasm-demo/www/"&gt;this playground page&lt;/a&gt; for trying out a WebAssembly build of the &lt;code&gt;html5ever&lt;/code&gt; and &lt;code&gt;markup5ever_rcdom&lt;/code&gt; crates, providing a tool for turning fragments of HTML into a parse tree.&lt;/p&gt;
    
        &lt;p&gt;Tags: &lt;a href="https://simonwillison.net/tags/browsers"&gt;browsers&lt;/a&gt;, &lt;a href="https://simonwillison.net/tags/research"&gt;research&lt;/a&gt;, &lt;a href="https://simonwillison.net/tags/rust"&gt;rust&lt;/a&gt;, &lt;a href="https://simonwillison.net/tags/webassembly"&gt;webassembly&lt;/a&gt;, &lt;a href="https://simonwillison.net/tags/servo"&gt;servo&lt;/a&gt;, &lt;a href="https://simonwillison.net/tags/claude-code"&gt;claude-code&lt;/a&gt;&lt;/p&gt;
    

</summary><category term="browsers"/><category term="research"/><category term="rust"/><category term="webassembly"/><category term="servo"/><category term="claude-code"/></entry><entry><title>Unicode Explorer using binary search over fetch() HTTP range requests</title><link href="https://simonwillison.net/2026/Feb/27/unicode-explorer/#atom-tag" rel="alternate"/><published>2026-02-27T17:50:54+00:00</published><updated>2026-02-27T17:50:54+00:00</updated><id>https://simonwillison.net/2026/Feb/27/unicode-explorer/#atom-tag</id><summary type="html">
    
&lt;p&gt;&lt;strong&gt;&lt;a href="https://tools.simonwillison.net/unicode-binary-search"&gt;Unicode Explorer using binary search over fetch() HTTP range requests&lt;/a&gt;&lt;/strong&gt;&lt;/p&gt;
Here's a little prototype I built this morning from my phone as an experiment in HTTP range requests, and a general example of using LLMs to satisfy curiosity.&lt;/p&gt;
&lt;p&gt;I've been collecting &lt;a href="https://simonwillison.net/tags/http-range-requests/"&gt;HTTP range tricks&lt;/a&gt; for a while now, and I decided it would be fun to build something with them myself that used binary search against a large file to do something useful.&lt;/p&gt;
&lt;p&gt;So I &lt;a href="https://claude.ai/share/47860666-cb20-44b5-8cdb-d0ebe363384f"&gt;brainstormed with Claude&lt;/a&gt;. The challenge was coming up with a use case for binary search where the data could be naturally sorted in a way that would benefit from binary search.&lt;/p&gt;
&lt;p&gt;One of Claude's suggestions was looking up information about unicode codepoints, which means searching through many MBs of metadata.&lt;/p&gt;
&lt;p&gt;I had Claude write me a spec to feed to Claude Code - &lt;a href="https://github.com/simonw/research/pull/90#issue-4001466642"&gt;visible here&lt;/a&gt; - then kicked off an &lt;a href="https://simonwillison.net/2025/Nov/6/async-code-research/"&gt;asynchronous research project&lt;/a&gt; with Claude Code for web against my &lt;a href="https://github.com/simonw/research"&gt;simonw/research&lt;/a&gt; repo to turn that into working code.&lt;/p&gt;
&lt;p&gt;Here's the &lt;a href="https://github.com/simonw/research/tree/main/unicode-explorer-binary-search#readme"&gt;resulting report and code&lt;/a&gt;. One interesting thing I learned is that Range request tricks aren't compatible with HTTP compression because they mess with the byte offset calculations. I added &lt;code&gt;'Accept-Encoding': 'identity'&lt;/code&gt; to the &lt;code&gt;fetch()&lt;/code&gt; calls but this isn't actually necessary because Cloudflare and other CDNs automatically skip compression if a &lt;code&gt;content-range&lt;/code&gt; header is present.&lt;/p&gt;
&lt;p&gt;I deployed the result &lt;a href="https://tools.simonwillison.net/unicode-binary-search"&gt;to my tools.simonwillison.net site&lt;/a&gt;, after first tweaking it to query the data via range requests against a CORS-enabled 76.6MB file in an S3 bucket fronted by Cloudflare.&lt;/p&gt;
&lt;p&gt;The demo is fun to play with - type in a single character like &lt;code&gt;ø&lt;/code&gt; or a hexadecimal codepoint indicator like &lt;code&gt;1F99C&lt;/code&gt; and it will binary search its way through the large file and show you the steps it takes along the way:&lt;/p&gt;
&lt;p&gt;&lt;img alt="Animated demo of a web tool called Unicode Explore. I enter the ampersand character and hit Search. A box below shows a sequence of HTTP binary search requests made, finding in 17 steps with 3,864 bytes transferred and telling me that ampersand is U+0026 in Punctuation other, Basic Latin" src="https://static.simonwillison.net/static/2026/unicode-explore.gif" /&gt;


    &lt;p&gt;Tags: &lt;a href="https://simonwillison.net/tags/algorithms"&gt;algorithms&lt;/a&gt;, &lt;a href="https://simonwillison.net/tags/http"&gt;http&lt;/a&gt;, &lt;a href="https://simonwillison.net/tags/research"&gt;research&lt;/a&gt;, &lt;a href="https://simonwillison.net/tags/tools"&gt;tools&lt;/a&gt;, &lt;a href="https://simonwillison.net/tags/unicode"&gt;unicode&lt;/a&gt;, &lt;a href="https://simonwillison.net/tags/ai"&gt;ai&lt;/a&gt;, &lt;a href="https://simonwillison.net/tags/generative-ai"&gt;generative-ai&lt;/a&gt;, &lt;a href="https://simonwillison.net/tags/llms"&gt;llms&lt;/a&gt;, &lt;a href="https://simonwillison.net/tags/ai-assisted-programming"&gt;ai-assisted-programming&lt;/a&gt;, &lt;a href="https://simonwillison.net/tags/vibe-coding"&gt;vibe-coding&lt;/a&gt;, &lt;a href="https://simonwillison.net/tags/http-range-requests"&gt;http-range-requests&lt;/a&gt;&lt;/p&gt;



</summary><category term="algorithms"/><category term="http"/><category term="research"/><category term="tools"/><category term="unicode"/><category term="ai"/><category term="generative-ai"/><category term="llms"/><category term="ai-assisted-programming"/><category term="vibe-coding"/><category term="http-range-requests"/></entry><entry><title>Quoting Dimitris Papailiopoulos</title><link href="https://simonwillison.net/2026/Feb/17/dimitris-papailiopoulos/#atom-tag" rel="alternate"/><published>2026-02-17T14:04:44+00:00</published><updated>2026-02-17T14:04:44+00:00</updated><id>https://simonwillison.net/2026/Feb/17/dimitris-papailiopoulos/#atom-tag</id><summary type="html">
    &lt;blockquote cite="https://twitter.com/dimitrispapail/status/2023080289828831349"&gt;&lt;p&gt;But the intellectually interesting part for me is something else. &lt;strong&gt;I now have something close to a magic box where I throw in a question and a first answer comes back basically for free, in terms of human effort&lt;/strong&gt;. Before this, the way I'd explore a new idea is to either clumsily put something together myself or ask a student to run something short for signal, and if it's there, we’d go deeper. That quick signal step, i.e., finding out if a question has any meat to it, is what I can now do without taking up anyone else's time. It’s now between just me, Claude Code, and a few days of GPU time.&lt;/p&gt;
&lt;p&gt;I don’t know what this means for how we do research long term. I don’t think anyone does yet. But &lt;strong&gt;the distance between a question and a first answer just got very small&lt;/strong&gt;.&lt;/p&gt;&lt;/blockquote&gt;
&lt;p class="cite"&gt;&amp;mdash; &lt;a href="https://twitter.com/dimitrispapail/status/2023080289828831349"&gt;Dimitris Papailiopoulos&lt;/a&gt;, on running research questions though Claude Code&lt;/p&gt;

    &lt;p&gt;Tags: &lt;a href="https://simonwillison.net/tags/research"&gt;research&lt;/a&gt;, &lt;a href="https://simonwillison.net/tags/ai"&gt;ai&lt;/a&gt;, &lt;a href="https://simonwillison.net/tags/generative-ai"&gt;generative-ai&lt;/a&gt;, &lt;a href="https://simonwillison.net/tags/llms"&gt;llms&lt;/a&gt;, &lt;a href="https://simonwillison.net/tags/coding-agents"&gt;coding-agents&lt;/a&gt;, &lt;a href="https://simonwillison.net/tags/claude-code"&gt;claude-code&lt;/a&gt;&lt;/p&gt;



</summary><category term="research"/><category term="ai"/><category term="generative-ai"/><category term="llms"/><category term="coding-agents"/><category term="claude-code"/></entry><entry><title>Text a community college librarian</title><link href="https://simonwillison.net/2025/Dec/4/text-a-librarian/#atom-tag" rel="alternate"/><published>2025-12-04T23:52:21+00:00</published><updated>2025-12-04T23:52:21+00:00</updated><id>https://simonwillison.net/2025/Dec/4/text-a-librarian/#atom-tag</id><summary type="html">
    &lt;p&gt;I take tap dance evening classes at the &lt;a href="https://collegeofsanmateo.edu/"&gt;College of San Mateo&lt;/a&gt; community college. A neat bonus of this is that I'm now officially a student of that college, which gives me access to their library... including the ability to send text messages to the librarians asking for help with research.&lt;/p&gt;
&lt;p&gt;I recently wrote about &lt;a href="https://www.niche-museums.com/114"&gt;Coutellerie Nontronnaise&lt;/a&gt; on my Niche Museums website, a historic knife manufactory in Nontron, France. They had &lt;a href="https://niche-museums.imgix.net/Coutellerie-Nontronnaise-12.jpeg?w=1200&amp;amp;auto=compress"&gt;a certificate on the wall&lt;/a&gt; claiming that they had previously held a Guinness World Record for the smallest folding knife, but I had been unable to track down any supporting evidence.&lt;/p&gt;
&lt;p&gt;I posed this as a text message challenge to the librarians, and they tracked down &lt;a href="https://archive.org/details/lelivreguinnessd0000na/mode/2up?q=nontronnaise"&gt;the exact page&lt;/a&gt; from the 1989 "Le livre guinness des records" describing the record:&lt;/p&gt;
&lt;blockquote&gt;
&lt;p&gt;&lt;em&gt;Le plus petit&lt;/em&gt;&lt;/p&gt;
&lt;p&gt;Les établissements Nontronnaise ont réalisé un couteau de 10 mm de long, pour le Festival d’Aubigny, Vendée, qui s’est déroulé du 4 au 5 juillet 1987.&lt;/p&gt;
&lt;/blockquote&gt;
&lt;p&gt;Thank you, Maria at the CSM library!&lt;/p&gt;

    &lt;p&gt;Tags: &lt;a href="https://simonwillison.net/tags/libraries"&gt;libraries&lt;/a&gt;, &lt;a href="https://simonwillison.net/tags/museums"&gt;museums&lt;/a&gt;, &lt;a href="https://simonwillison.net/tags/research"&gt;research&lt;/a&gt;&lt;/p&gt;



</summary><category term="libraries"/><category term="museums"/><category term="research"/></entry><entry><title>The SIFT method</title><link href="https://simonwillison.net/2025/Sep/7/the-sift-method/#atom-tag" rel="alternate"/><published>2025-09-07T20:51:31+00:00</published><updated>2025-09-07T20:51:31+00:00</updated><id>https://simonwillison.net/2025/Sep/7/the-sift-method/#atom-tag</id><summary type="html">
    
&lt;p&gt;&lt;strong&gt;&lt;a href="https://guides.lib.uchicago.edu/c.php?g=1241077&amp;amp;p=9082322"&gt;The SIFT method&lt;/a&gt;&lt;/strong&gt;&lt;/p&gt;
The SIFT method is "an evaluation strategy developed by digital literacy expert, Mike Caulfield, to help determine whether online content can be trusted for credible or reliable sources of information."&lt;/p&gt;
&lt;p&gt;This looks &lt;em&gt;extremely&lt;/em&gt; useful as a framework for helping people more effectively consume information online (increasingly gathered with &lt;a href="https://simonwillison.net/tags/ai-assisted-search/"&gt;the help of LLMs&lt;/a&gt;).&lt;/p&gt;
&lt;ul&gt;
&lt;li&gt;&lt;strong&gt;Stop&lt;/strong&gt;. "Be aware of your emotional response to the headline or information in the article" to protect against clickbait, and don't read further or share until you've applied the other three steps.&lt;/li&gt;
&lt;li&gt;&lt;strong&gt;Investigate the Source&lt;/strong&gt;. Apply &lt;a href="https://pressbooks.pub/webliteracy/chapter/what-reading-laterally-means/"&gt;lateral reading&lt;/a&gt;, checking what others say about the source rather than just trusting their "about" page.&lt;/li&gt;
&lt;li&gt;&lt;strong&gt;Find Better Coverage&lt;/strong&gt;. "Use lateral reading to see if you can find other sources corroborating the same information or disputing it" and consult trusted fact checkers if necessary.&lt;/li&gt;
&lt;li&gt;&lt;strong&gt;Trace Claims, Quotes, and Media to their Original Context&lt;/strong&gt;. Try to find the original report or referenced material to learn more and check it isn't being represented out of context.&lt;/li&gt;
&lt;/ul&gt;
&lt;p&gt;This framework really resonates with me: it formally captures and improves on a bunch of informal techniques I've tried to apply in my own work.

    &lt;p&gt;&lt;small&gt;&lt;/small&gt;Via &lt;a href="https://bsky.app/profile/anildash.com/post/3lyavuu6ku22r"&gt;@anildash.com&lt;/a&gt;&lt;/small&gt;&lt;/p&gt;


    &lt;p&gt;Tags: &lt;a href="https://simonwillison.net/tags/blogging"&gt;blogging&lt;/a&gt;, &lt;a href="https://simonwillison.net/tags/research"&gt;research&lt;/a&gt;, &lt;a href="https://simonwillison.net/tags/ai-assisted-search"&gt;ai-assisted-search&lt;/a&gt;, &lt;a href="https://simonwillison.net/tags/digital-literacy"&gt;digital-literacy&lt;/a&gt;&lt;/p&gt;



</summary><category term="blogging"/><category term="research"/><category term="ai-assisted-search"/><category term="digital-literacy"/></entry><entry><title>The Wikimedia Research Newsletter</title><link href="https://simonwillison.net/2025/Jun/13/wikimedia-research-newsletter/#atom-tag" rel="alternate"/><published>2025-06-13T20:24:37+00:00</published><updated>2025-06-13T20:24:37+00:00</updated><id>https://simonwillison.net/2025/Jun/13/wikimedia-research-newsletter/#atom-tag</id><summary type="html">
    
&lt;p&gt;&lt;strong&gt;&lt;a href="https://meta.wikimedia.org/wiki/Research:Newsletter"&gt;The Wikimedia Research Newsletter&lt;/a&gt;&lt;/strong&gt;&lt;/p&gt;
Speaking of &lt;a href="https://simonwillison.net/2025/Jun/13/blogging-about-papers/"&gt;summarizing research papers&lt;/a&gt;, I just learned about this newsletter and it is an absolute &lt;em&gt;gold mine&lt;/em&gt;:&lt;/p&gt;
&lt;blockquote&gt;
&lt;p&gt;The &lt;strong&gt;Wikimedia Research Newsletter (WRN)&lt;/strong&gt; covers research of relevance to the Wikimedia community. It has been appearing generally monthly since 2011, and features both academic research publications and internal research done at the Wikimedia Foundation.&lt;/p&gt;
&lt;/blockquote&gt;
&lt;p&gt;The March 2025 issue had a fascinating section titled &lt;a href="https://meta.wikimedia.org/wiki/Research:Newsletter/2025/March#So_again,_what_has_the_impact_of_ChatGPT_really_been?"&gt;So again, what has the impact of ChatGPT really been?&lt;/a&gt; pulled together by WRN co-founder Tilman Bayer. It covers ten different papers, here's one note that stood out to me:&lt;/p&gt;
&lt;blockquote&gt;
&lt;p&gt;[...]  the authors observe an increasing frequency of the words “crucial” and “additionally”, which are favored by ChatGPT [according to previous research] in the content of Wikipedia article.&lt;/p&gt;
&lt;/blockquote&gt;

    &lt;p&gt;&lt;small&gt;&lt;/small&gt;Via &lt;a href="https://mastodon.social/@diegodlh/114677186749907634"&gt;@diegodlh&lt;/a&gt;&lt;/small&gt;&lt;/p&gt;


    &lt;p&gt;Tags: &lt;a href="https://simonwillison.net/tags/research"&gt;research&lt;/a&gt;, &lt;a href="https://simonwillison.net/tags/wikipedia"&gt;wikipedia&lt;/a&gt;, &lt;a href="https://simonwillison.net/tags/chatgpt"&gt;chatgpt&lt;/a&gt;, &lt;a href="https://simonwillison.net/tags/paper-review"&gt;paper-review&lt;/a&gt;&lt;/p&gt;



</summary><category term="research"/><category term="wikipedia"/><category term="chatgpt"/><category term="paper-review"/></entry><entry><title>Help with next steps for a startup</title><link href="https://simonwillison.net/2016/Sep/4/help-with-next-steps-for/#atom-tag" rel="alternate"/><published>2016-09-04T09:54:00+00:00</published><updated>2016-09-04T09:54:00+00:00</updated><id>https://simonwillison.net/2016/Sep/4/help-with-next-steps-for/#atom-tag</id><summary type="html">
    &lt;p&gt;&lt;em&gt;My answer to &lt;a href="http://ask.metafilter.com/300070/Help-with-next-steps-for-a-startup"&gt;Help with next steps for a startup&lt;/a&gt; on Ask MetaFilter&lt;/em&gt;&lt;/p&gt;
&lt;p&gt;Have you thought about applying to Y Combinator? The reason I ask is that &amp;quot;I have lots of expertise in language learning and basically zero expertise in startups, market research, business, fundraising, app pricing, etc&amp;quot; is pretty much YC's sweet spot: they know that it's much easier teaching those things to engineers and makers than it is to teach engineering to business people (I'm assuming you have product and engineering skills based on your description of your progress so far).&lt;/p&gt;
&lt;p&gt;I went through YC a few years ago from a similar starting point (engineering and product experience but no business skills) and found it to be an excellent decision.&lt;/p&gt;
&lt;p&gt;&lt;em&gt;Then &lt;a href="http://ask.metafilter.com/300070/Help-with-next-steps-for-a-startup#4347072"&gt;at 13:53&lt;/a&gt;:&lt;/em&gt;&lt;/p&gt;
&lt;p&gt;Also worth mentioning: YC accept less than a hundred out of many thousands of applications, but your description of your progress so far should be enough to help your application stand out. It's very competitive but I think you would be in with a better chance than many.&lt;/p&gt;
    
        &lt;p&gt;Tags: &lt;a href="https://simonwillison.net/tags/ask-metafilter"&gt;ask-metafilter&lt;/a&gt;, &lt;a href="https://simonwillison.net/tags/business"&gt;business&lt;/a&gt;, &lt;a href="https://simonwillison.net/tags/fundraising"&gt;fundraising&lt;/a&gt;, &lt;a href="https://simonwillison.net/tags/research"&gt;research&lt;/a&gt;, &lt;a href="https://simonwillison.net/tags/small"&gt;small&lt;/a&gt;, &lt;a href="https://simonwillison.net/tags/vc"&gt;vc&lt;/a&gt;, &lt;a href="https://simonwillison.net/tags/market"&gt;market&lt;/a&gt;&lt;/p&gt;
    

</summary><category term="ask-metafilter"/><category term="business"/><category term="fundraising"/><category term="research"/><category term="small"/><category term="vc"/><category term="market"/></entry><entry><title>Building Rome in a Day</title><link href="https://simonwillison.net/2009/Jul/29/building/#atom-tag" rel="alternate"/><published>2009-07-29T15:41:03+00:00</published><updated>2009-07-29T15:41:03+00:00</updated><id>https://simonwillison.net/2009/Jul/29/building/#atom-tag</id><summary type="html">
    
&lt;p&gt;&lt;strong&gt;&lt;a href="http://grail.cs.washington.edu/rome/"&gt;Building Rome in a Day&lt;/a&gt;&lt;/strong&gt;&lt;/p&gt;
“The ﬁrst system capable of city-scale reconstruction from unstructured photo collections”—computer vision techniques used to construct 3D models of cities using 10s of thousands of photos from Flickr. Reminiscent of Microsoft PhotoSynth.

    &lt;p&gt;&lt;small&gt;&lt;/small&gt;Via &lt;a href="http://digitalurban.blogspot.com/2009/07/building-rome-in-day-3d-city-via-flickr.html"&gt;Digital Urban&lt;/a&gt;&lt;/small&gt;&lt;/p&gt;


    &lt;p&gt;Tags: &lt;a href="https://simonwillison.net/tags/3d"&gt;3d&lt;/a&gt;, &lt;a href="https://simonwillison.net/tags/computer-vision"&gt;computer-vision&lt;/a&gt;, &lt;a href="https://simonwillison.net/tags/flickr"&gt;flickr&lt;/a&gt;, &lt;a href="https://simonwillison.net/tags/photos"&gt;photos&lt;/a&gt;, &lt;a href="https://simonwillison.net/tags/photosynth"&gt;photosynth&lt;/a&gt;, &lt;a href="https://simonwillison.net/tags/research"&gt;research&lt;/a&gt;, &lt;a href="https://simonwillison.net/tags/rome"&gt;rome&lt;/a&gt;&lt;/p&gt;



</summary><category term="3d"/><category term="computer-vision"/><category term="flickr"/><category term="photos"/><category term="photosynth"/><category term="research"/><category term="rome"/></entry><entry><title>Yahoo! Releases OpenID Research</title><link href="https://simonwillison.net/2008/Oct/14/yahoo/#atom-tag" rel="alternate"/><published>2008-10-14T16:59:12+00:00</published><updated>2008-10-14T16:59:12+00:00</updated><id>https://simonwillison.net/2008/Oct/14/yahoo/#atom-tag</id><summary type="html">
    
&lt;p&gt;&lt;strong&gt;&lt;a href="http://developer.yahoo.net/blog/archives/2008/10/open_id_research.html"&gt;Yahoo! Releases OpenID Research&lt;/a&gt;&lt;/strong&gt;&lt;/p&gt;
Extremely valuable research, conducted with a group of typical Yahoo! users. OpenIDs usability remains bad, and if we don’t get it right soon something centralised like Facebook Connect will take over and the Web will stop being open.


    &lt;p&gt;Tags: &lt;a href="https://simonwillison.net/tags/facebook"&gt;facebook&lt;/a&gt;, &lt;a href="https://simonwillison.net/tags/facebookconnect"&gt;facebookconnect&lt;/a&gt;, &lt;a href="https://simonwillison.net/tags/openid"&gt;openid&lt;/a&gt;, &lt;a href="https://simonwillison.net/tags/research"&gt;research&lt;/a&gt;, &lt;a href="https://simonwillison.net/tags/usability"&gt;usability&lt;/a&gt;, &lt;a href="https://simonwillison.net/tags/yahoo"&gt;yahoo&lt;/a&gt;&lt;/p&gt;



</summary><category term="facebook"/><category term="facebookconnect"/><category term="openid"/><category term="research"/><category term="usability"/><category term="yahoo"/></entry><entry><title>Can social bookmarking services prevent a bookmark from becoming dead links?</title><link href="https://simonwillison.net/2006/Jan/27/can-social-bookmarking-services-prevent/#atom-tag" rel="alternate"/><published>2006-01-27T09:50:00+00:00</published><updated>2006-01-27T09:50:00+00:00</updated><id>https://simonwillison.net/2006/Jan/27/can-social-bookmarking-services-prevent/#atom-tag</id><summary type="html">
    &lt;p&gt;&lt;em&gt;My answer to &lt;a href="http://ask.metafilter.com/31586/Can-social-bookmarking-services-prevent-a-bookmark-from-becoming-dead-links#495066"&gt;Can social bookmarking services prevent a bookmark from becoming dead links?&lt;/a&gt; on Ask MetaFilter&lt;/em&gt;&lt;/p&gt;
&lt;p&gt;Yahoo!'s &lt;a href="http://myweb2.search.yahoo.com/"&gt;MyWeb 2.0&lt;/a&gt; can do that. (Disclaimer: I work for Yahoo!, but not directly on that product).&lt;/p&gt;
    
        &lt;p&gt;Tags: &lt;a href="https://simonwillison.net/tags/ask-metafilter"&gt;ask-metafilter&lt;/a&gt;, &lt;a href="https://simonwillison.net/tags/research"&gt;research&lt;/a&gt;, &lt;a href="https://simonwillison.net/tags/bookmark"&gt;bookmark&lt;/a&gt;, &lt;a href="https://simonwillison.net/tags/dead"&gt;dead&lt;/a&gt;, &lt;a href="https://simonwillison.net/tags/link"&gt;link&lt;/a&gt;&lt;/p&gt;
    

</summary><category term="ask-metafilter"/><category term="research"/><category term="bookmark"/><category term="dead"/><category term="link"/></entry></feed>