Viewing profile — tybug
tybug
HN member- Joined
- Wed, Jan 05, 2022, 5:54 PM UTC
- HN karma
- 76
- Public activity
- 29 items
- HN profile
- View on Hacker News ↗
About tybug
https://github.com/liam-devoe
Recent public activity
- story
- story
-
comment
Comment #47718680
We plan to rewrite hypothesis in rust and expose an FFI through that! This is a medium term plan (months, not weeks or years), but we're acutely aware that relying on a python comp…
-
comment
Comment #47709026
Yes! I just wrote up documentation for the protocol earlier this week: https://hegel.dev/reference/protocol . In reality, we hope to provide more guidance than this to people who w…
-
comment
Comment #47708906
I didn't expect to see Hegel when opening up HN today! Feel free to ask any questions about it. We released hegel-go earlier this week, and plan to release hegel-cpp sometime next …
-
comment
Comment #47510950
To put it on the record: my position is current models can't get us there, and neither can the next iteration of models, but in two model iterations this will be worth doing. There…
-
comment
Comment #47510829
`from_type` just supports a bunch more things than rust ever can due to the flexibility of python's type system. `from_type(object)` is amazing, for example, and not something we c…
-
comment
Comment #47507365
Yep, `#[derive(DefaultGenerator)]` and `generators::default ()` are the right tools here. This is one of the areas we've dogfooded the least, so we'd definitely be happy to get fee…
-
comment
Comment #47504963
I actually think there's another angle here where PBT helps, which wasn't explored in the blog post. That angle is legibility . How do you know your AI-written slop software is doi…
-
comment
Comment #47504401
As possibly the one community on earth where it's actually better to post the code than the blog post: TL;DR this is a universal property-based testing protocol ( https://github.co…
- story
-
comment
Comment #45850943
Appreciate the thoughts <3. I do think there might be stronger examples we could choose. Possibly json encode/decode..
-
comment
Comment #45831330
(Hypothesis maintainer here) If you have recommendations for a better example on the front page, I'd love to hear them! (I mean this entirely genuinely and non-sarcastically; I agr…
-
comment
Comment #45820135
(Hypothesis maintainer here) Yup, a standard test suite just doesn't run for long enough for coverage guidance to be worthwhile by default. That said, coverage-guided fuzzing can b…
-
comment
Comment #43874233
Nice! "testing your test code" is particularly important when dealing with PBT distributions, especially when your generator gets more complicated. Tyche [0] is another cool tool f…
-
comment
Comment #43748112
The Hypothesis explain phase [1][2] does this! fails_on_empty_third_arg( a = "", # or any other generated value b = "", # or any other generated value c = "", d = "", # or any othe…
-
comment
Comment #42618302
That kind of behavior can happen at the threshold of Hypothesis' internal limit on entropy - though if you're not hitting HealthCheck.data_too_large then this seems unlikely. Let m…
-
comment
Comment #40443661
(not OP but I would be surprised if the answer wasn't) yes, because you're changing the order in which the random draws are interpreted. But this isn't a problem in practice becaus…
-
comment
Comment #37911039
You're right, I misstated this - but I don't think this is fatal. The other sibling commenters pointed out the real issue with my thinking. The argument goes the same even though I…
-
comment
Comment #37911030
I suppose I did! I was having a hard time reconciling this with the intuition that BB(n) is in principle "computable" (colloquially speaking) for any n - my thinking went that if I…
-
comment
Comment #37910951
I'm hoping someone can enlighten me here. My understanding is that there is a turing machine of 748 states [0], which halts iff ZFC is inconsistent (Thm 1). But this machine is a "…
-
comment
Comment #36672790
No disagreement here. But I hold that this is an especially confusing way of describing independent statements, especially in this paper, which certainly was written by a logician.…
-
comment
Comment #36662799
A common misconception in the first paragraph: > However, Godel shattered these aspirations in 1931 by proving the existence of true but unprovable mathematical formulas. Godel sen…
-
comment
Comment #33237237
Formal systems need not be consistent; if a formal system assumes both P and ~P as axioms, you can derive S and ~S (for any S) by explosion.
-
comment
Comment #33237160
I would argue "reasoning about programs" formally means "can prove P Q R ..." (with appropriate choices for P Q R) and doesn't implicitly carry an assumption of consistency. But, f…