HackerReposA FIELD GUIDE TO OPEN SOURCE
ProSponsor the shelf♧ 0
← Back to top all-time
leapingio
leaping
Python2024–2024
leapingio / leaping

leaping

Discover this repository through its Hacker News conversations.

2Distinct people
4Mentions
0Explicit recommenders
261GitHub stars
REPOSITORY AT A GLANCE

What to know before exploring

What it is

A public description has not been verified.

Where it is used

No documented product use has been verified yet.

What people are saying

No recommendation phrase was found in the indexed comments.

No classified warning is attached to this page. Read the discussions before treating silence as approval.

Also in these discussions

No other repository is repeatedly linked in the same discussions.

This week on Hacker News

Nov 7–Nov 14 UTC · Direct repository links and separately labeled related project stories. Indexed through 11/14/2026, 1:49:46 PM UTC.

No direct repository links were found in the indexed HN discussions over the past seven days. Older discussions are available below.

Mentions over time

HN mentions by day4 dated mentions

Observed mentions: 2024-02-27 18:59:56 UTC to 2024-03-22 21:58:19 UTC.

01232024-02-27 00:00:00 UTC to 2024-02-28 00:00:00 UTC (exclusive): 1 mentions; 1 submissions, 0 commentsFeb 272024-02-28 00:00:00 UTC to 2024-02-29 00:00:00 UTC (exclusive): 0 mentions; 0 submissions, 0 comments2024-02-29 00:00:00 UTC to 2024-03-01 00:00:00 UTC (exclusive): 0 mentions; 0 submissions, 0 comments2024-03-01 00:00:00 UTC to 2024-03-02 00:00:00 UTC (exclusive): 0 mentions; 0 submissions, 0 comments2024-03-02 00:00:00 UTC to 2024-03-03 00:00:00 UTC (exclusive): 0 mentions; 0 submissions, 0 comments2024-03-03 00:00:00 UTC to 2024-03-04 00:00:00 UTC (exclusive): 0 mentions; 0 submissions, 0 comments2024-03-04 00:00:00 UTC to 2024-03-05 00:00:00 UTC (exclusive): 0 mentions; 0 submissions, 0 comments2024-03-05 00:00:00 UTC to 2024-03-06 00:00:00 UTC (exclusive): 0 mentions; 0 submissions, 0 comments2024-03-06 00:00:00 UTC to 2024-03-07 00:00:00 UTC (exclusive): 0 mentions; 0 submissions, 0 comments2024-03-07 00:00:00 UTC to 2024-03-08 00:00:00 UTC (exclusive): 0 mentions; 0 submissions, 0 comments2024-03-08 00:00:00 UTC to 2024-03-09 00:00:00 UTC (exclusive): 0 mentions; 0 submissions, 0 comments2024-03-09 00:00:00 UTC to 2024-03-10 00:00:00 UTC (exclusive): 0 mentions; 0 submissions, 0 comments2024-03-10 00:00:00 UTC to 2024-03-11 00:00:00 UTC (exclusive): 0 mentions; 0 submissions, 0 commentsMar 102024-03-11 00:00:00 UTC to 2024-03-12 00:00:00 UTC (exclusive): 0 mentions; 0 submissions, 0 comments2024-03-12 00:00:00 UTC to 2024-03-13 00:00:00 UTC (exclusive): 0 mentions; 0 submissions, 0 comments2024-03-13 00:00:00 UTC to 2024-03-14 00:00:00 UTC (exclusive): 0 mentions; 0 submissions, 0 comments2024-03-14 00:00:00 UTC to 2024-03-15 00:00:00 UTC (exclusive): 0 mentions; 0 submissions, 0 comments2024-03-15 00:00:00 UTC to 2024-03-16 00:00:00 UTC (exclusive): 0 mentions; 0 submissions, 0 comments2024-03-16 00:00:00 UTC to 2024-03-17 00:00:00 UTC (exclusive): 0 mentions; 0 submissions, 0 comments2024-03-17 00:00:00 UTC to 2024-03-18 00:00:00 UTC (exclusive): 0 mentions; 0 submissions, 0 comments2024-03-18 00:00:00 UTC to 2024-03-19 00:00:00 UTC (exclusive): 0 mentions; 0 submissions, 0 comments2024-03-19 00:00:00 UTC to 2024-03-20 00:00:00 UTC (exclusive): 0 mentions; 0 submissions, 0 comments2024-03-20 00:00:00 UTC to 2024-03-21 00:00:00 UTC (exclusive): 0 mentions; 0 submissions, 0 comments2024-03-21 00:00:00 UTC to 2024-03-22 00:00:00 UTC (exclusive): 0 mentions; 0 submissions, 0 comments2024-03-22 00:00:00 UTC to 2024-03-23 00:00:00 UTC (exclusive): 3 mentions; 1 submissions, 2 commentsMar 22

Counts come from the repository’s dated source evidence. Index cutoff: 2026-11-02 08:16:59 UTC.

View mention counts and date ranges
UTC ranges include their start and exclude their end. Select a period to filter the source evidence.
PeriodStart (UTC)End (exclusive, UTC)MentionsSubmissionsComments
Feb 272024-02-27 00:00:00 UTC2024-02-28 00:00:00 UTC110
Feb 282024-02-28 00:00:00 UTC2024-02-29 00:00:00 UTC000
Feb 292024-02-29 00:00:00 UTC2024-03-01 00:00:00 UTC000
Mar 12024-03-01 00:00:00 UTC2024-03-02 00:00:00 UTC000
Mar 22024-03-02 00:00:00 UTC2024-03-03 00:00:00 UTC000
Mar 32024-03-03 00:00:00 UTC2024-03-04 00:00:00 UTC000
Mar 42024-03-04 00:00:00 UTC2024-03-05 00:00:00 UTC000
Mar 52024-03-05 00:00:00 UTC2024-03-06 00:00:00 UTC000
Mar 62024-03-06 00:00:00 UTC2024-03-07 00:00:00 UTC000
Mar 72024-03-07 00:00:00 UTC2024-03-08 00:00:00 UTC000
Mar 82024-03-08 00:00:00 UTC2024-03-09 00:00:00 UTC000
Mar 92024-03-09 00:00:00 UTC2024-03-10 00:00:00 UTC000
Mar 102024-03-10 00:00:00 UTC2024-03-11 00:00:00 UTC000
Mar 112024-03-11 00:00:00 UTC2024-03-12 00:00:00 UTC000
Mar 122024-03-12 00:00:00 UTC2024-03-13 00:00:00 UTC000
Mar 132024-03-13 00:00:00 UTC2024-03-14 00:00:00 UTC000
Mar 142024-03-14 00:00:00 UTC2024-03-15 00:00:00 UTC000
Mar 152024-03-15 00:00:00 UTC2024-03-16 00:00:00 UTC000
Mar 162024-03-16 00:00:00 UTC2024-03-17 00:00:00 UTC000
Mar 172024-03-17 00:00:00 UTC2024-03-18 00:00:00 UTC000
Mar 182024-03-18 00:00:00 UTC2024-03-19 00:00:00 UTC000
Mar 192024-03-19 00:00:00 UTC2024-03-20 00:00:00 UTC000
Mar 202024-03-20 00:00:00 UTC2024-03-21 00:00:00 UTC000
Mar 212024-03-21 00:00:00 UTC2024-03-22 00:00:00 UTC000
Mar 222024-03-22 00:00:00 UTC2024-03-23 00:00:00 UTC312

What Hacker News says

4 sources
kvptkr·Mar 22, 2024Submission

Show HN: Leaping – Debug Python tests instantly with an LLM debugger

Hi HN! We’re Adrien and Kanav. We met at our previous job, where we spent about a third of our lives combating a constant firehose of bugs. In the hope of reducing this pain for others in the future, we’re working on automating debugging. We’re currently working on a platform that ingests logs and then automatically reproduces, root causes and ultimately fixes production bugs as they happen. You can see some of our work on this here - https://news.ycombinator.com/item?id=39528087 As we were building the root-cause phase of our automated debugger, we realized that we developed something that resembled an omniscient debugger. Like an omniscient debugger, it also keeps track of variable assignments over time but, you can interact with it at a higher level than a debugger using natural language. We ended up sticking it in a pytest plugin and
Read the rest
have been using it ourselves for development over the past few weeks. Using this pytest plugin, you’re able to reason at a much higher level than conventional debuggers and can ask questions like: - Why did function x get hit? - Why was variable y set to this value? - What changes can I make to this code to make this test pass? Here’s a brief demo of this in action: https://www.loom.com/share/94ebe34097a343c39876d7109f2a1428 To achieve this, we first instrument the test using sys.settrace (or, on versions of python >3.12, the far better sys.monitoring!) to keep a history of all the functions that were called, along with the calling line numbers. We then re-run the test and use AST parsing to find all the variable assignments and keep track of those changes over time. We also use AST parsing to obtain the source code for these functions. We then neatly format and pass all this context to GPT. We’d love it if you checked the pytest plugin out and we welcome all feedback :) . If you want to chat bugs, our emails are also always open - kanav@leaping.io
120 points · Open discussion

Show HN: Leaping – Open-source debugging with LLMs

Show HN: Leaping - Open-source debugging with LLMs Hi HN! We’re Adrien and Kanav. We met at our previous job, where we spent about a third of our life combating a constant firehose of bugs. In the hope of reducing this pain for others in the future, we’re working on automating debugging. We started by capturing information from running applications to then ‘replay’ relevant sessions later. Our approach for Python involved extensive monkey patching: we’d use OpenTelemetry-style instrumentation to hook into the request/response lifecycle, and capture anything non-deterministic (random, time, database/third-party API calls, etc.). We would then run your code again, mocking out the non-determinism with the captured values from production, which would let you fix production bugs with the local debugger experience. You might recognize this as a
Read the rest
variant of omniscient debugging. We think it was a nifty idea, but we couldn’t get past the performance overhead/security concerns. Approaching the problem differently, we thought - could we not just grab a stack trace and sort of “figure it out” from there? Whether that’s possible in the general case is up for debate – but we think that eventually, yes. The argument goes as follows: developers can solve bugs not because they are particularly clever or experienced (though it helps), but rather because they are willing to spend enough time coming up with increasingly informed hypotheses (“was the variable set incorrectly inside of this function?”) that they can test out in tight feedback loops (“let me print out the variable before and after the function call”). We wondered: with the proper context and guidance, why couldn’t an LLM do the same? Over the last few weeks, we’ve been working on an approach that emulates the failing test approach to debugging, where you first reproduce the error in a failing test, then fix the source code, and finally run the test again to make sure it passes. Concretely, we take a stack trace, and start by simply re-running the function that failed. We then report the result back to the LLM, add relevant source code to the context window (with Tree-sitter and LSP), and prompt the AI for a code change that will get us closer to reproducing the bug. We apply those changes, re-run the script, and keep looping until we get the same bug as the original stack trace. Then the LLM formulates a root cause, generates a fix, we run the code again - and if the bug goes away, we call it a day. We’re also looking into letting the LLM interact with a pdb shell, as well as implementing RAG for better context fetching. One thing that excites us about generating a functioning test case with a step-by-step explanation for the fix is that results are somewhat grounded in reality, making hallucinations/confabulations less likely. Here’s a 50 second demo of how this approach fares on a (perhaps contrived) error: https://www.loom.com/share/a54c981536a54d3c9c269d8356ea0d51?sid=aeafd2d1-9b86-43ad… We’re working on releasing a self-hosted Python version in the next few weeks on our GitHub repo: https://github.com/leapingio/leaping (right now it’s just the demo source code). This is just the first step towards a larger goal, so we’d love to hear any and all feedback/questions, or feel free to shoot me an email at adrien@leaping.io!
15 points · Open discussion

MAKE YOURSELF AT HOME

A few shortcuts

/
Search the collection
?
Open this guide
Esc
Close dialogs and navigation

Your saved repositories and interests stay in this browser.