Hacker News: krzysz00

New comment by krzysz00 in "AI Lazyslop and Personal Responsibility"

krzysz00 — Mon, 26 Jan 2026 20:28:03 +0000

This does seem to align decently well with, for example, the policy the LLVM project recently adopted https://llvm.org/docs/AIToolPolicy.html , which allows for AI but requires a human in the loop that understands the code and allows for fast closure of "extractive" PRs that are mainly a timesink for reviewers where the author doesn't seem to be quite sure what's going on.

New comment by krzysz00 in "Ask HN: Who wants to be hired? (March 2021)"

krzysz00 — Tue, 02 Mar 2021 01:27:39 +0000

Location: Seattle Remote: Yes Willing to relocate: To major cities on suburbs with good non-car commute options (that is, not Mountain View)

Technologies: Much of my recent experience is in Rust, but I've worked in several languages and have broad systems experience. So also Python, C++, program synthesis (including Z3), and more on the resume, Erlang, and so on.

I'm Krzysztof. I'm indefinitely pausing/dropping out of a PhD in program synthesis with my Master's, having realized I want to work on something more applied and that the structure of a PhD may not be for me. I'm overall looking for interesting work that's generally backend-focused. While much of my recent work has been on high-performance code generation, I'm actively open to expending out into roles like reliability engineering, infrastructure, and so on.

Resume: https://kdrewniak.com/resume.pdf

Email: krzysdrewniak@gmail.com

New comment by krzysz00 in "BLIS: BLAS-Like Library Instantiation Software Framework"

krzysz00 — Sun, 27 Mar 2016 19:02:22 +0000

There's also [libflame](https://github.com/flame/libflame) by the same group, which is a higher-level API for matrix computations. The library's API si such that you can derive an algorithm (along with its proof of correctness) on paper and then translate the notation of the proof directly into code.

New comment by krzysz00 in "Announcing Rust 1.0"

krzysz00 — Sat, 16 May 2015 03:22:56 +0000

You can find some more {complex, idiomatic, not terribly hacked together} Rust kernels at https://github.com/thepowersgang/ .

New comment by krzysz00 in "Announcing Rust 1.0"

krzysz00 — Sat, 16 May 2015 02:54:03 +0000

I'm not sure what you're getting at. More of what?

New comment by krzysz00 in "Announcing Rust 1.0"

krzysz00 — Fri, 15 May 2015 22:25:09 +0000

My current approach to the heap problem (I'm working on a toy Rust kernel) is to compile the allocator portions of the standard library (liballoc) with a configuration flag that makes them use a particular set of external functions as the low-level heap allocation machinery. Then, my kernel provides these functions, and all the nice stuff (Box, Vec, etc.) "just works".

IF you're curious, the relevant code is at https://github.com/krzysz00/rust-kernel/blob/master/kernel/m... . The functions that start with "rust_" are the allocator interface

New comment by krzysz00 in "Solving the Go Challenge 1 in Erlang"

krzysz00 — Fri, 20 Mar 2015 03:12:13 +0000

I guess one interpretation of Erlang's = (this is from someone rather new to the language) is "Make the thing on the left equal to the thing on the right without mutating existing variables. If that's impossible, error". That nicely accounts for the apparent dual nature of the = operator.

New comment by krzysz00 in "GCC Non-bugs"

krzysz00 — Mon, 02 Mar 2015 06:03:15 +0000

Well, every base has issues with non-termination. In base 10, we have problems like 1/3 = 0.33333... . Base 2 has its own set of non-terminating decimal expansions, including 1 / 3 = 0.01010101... and 1 / 10 = 0.0001100110011... . Since we only have finite storage space, we have to cut the repeating string of digits off somewhere, no matter what base we're in. This can cause rounding issues.

You can't dodge all your rounding problems by changing base. There are binary-coded decimal (BCD) systems that store numbers as strings of decimal digits. You can generally find these in calculators (ever notice that a TI-84 overflows after 9.(9)e99) or some financial software. However, you'll still have problems like the 0.1 * 0.2 issue in binary floating-point. For example (assuming shorter-than-usual numbers):

2/3 = 0.66... ~ 0.66667

2/3 + 2/3 ~ 0.66667 + 0.66667 = 1.33334

However, 4/3 = 1.33333... ~ 1.33333, which isn't the same result.

Basically, you can't get away from this problem, you can only push it around to cases you care less about.

(You probably can't find an API for binary-coded decimal in $LANGUAGE unless $LANGUAGE is often used for tasks where you really really don't want any float-related gotchas since most everyone else doesn't care too much).

New comment by krzysz00 in "GCC Non-bugs"

krzysz00 — Mon, 02 Mar 2015 05:04:45 +0000

If by "decimal numbers" you mean the reals written in base 10, how do you propose we precisely represent the result of 1 / 3 . Or pi?

New comment by krzysz00 in "The curious case of disappearing Polish S"

krzysz00 — Tue, 03 Feb 2015 14:45:23 +0000

The feature is rather useful for record-keeping purposes (also known as CYA).

New comment by krzysz00 in "Army open-sources cyber defense code in new GitHub project"

krzysz00 — Sun, 01 Feb 2015 05:29:36 +0000

As this comment's uncle pointed out, you can probably find a "fill in the blank" DMCA notice somewhere on the net.

If that doesn't work, many lawyers give free consultations (AFAIK), and there's probably someone willing to take the case in exchange for X% of the settlement.

New comment by krzysz00 in "Army open-sources cyber defense code in new GitHub project"

krzysz00 — Sun, 01 Feb 2015 04:28:10 +0000

Could you use a DMCA-like thing to get them to stop doing that?

New comment by krzysz00 in "Nobody Ever Gets Credit for Fixing Problems That Never Happened (2001) [pdf]"

krzysz00 — Sat, 24 Jan 2015 23:46:41 +0000

You probably need a font that covers the relevant ligatures. Does "ﬁ" display for you? That's the Unicode codepoint U+FB01.

New comment by krzysz00 in "A Localization Horror Story: It Could Happen to You"

krzysz00 — Fri, 16 Jan 2015 14:30:16 +0000

How do you change your negative sign on a unixoid? The only reference to negative signs in locale(5) is under LC_MONETARY.

New comment by krzysz00 in "G()('al')"

krzysz00 — Sun, 27 Jul 2014 04:24:36 +0000

I'm pull request #36.

New comment by krzysz00 in "G()('al')"

krzysz00 — Sun, 27 Jul 2014 04:01:51 +0000

Not too difficult in Common Lisp (the parser is fully exposed to user code, so I just changed the meaning of "g").

New comment by krzysz00 in "Accepted projects – Google Summer of Code 2014"

krzysz00 — Tue, 22 Apr 2014 16:37:06 +0000

I also got accepted to work on Unicode support in SBCL!

New comment by krzysz00 in "You appear to be advocating a new IDE. Here's why it will not succeed"

krzysz00 — Tue, 25 Mar 2014 00:26:43 +0000

The reverse, I think.

Winning entries from the 2013 International Obfuscated C Code Contest (IOCCC)

krzysz00 — Sat, 04 Jan 2014 02:54:52 +0000

Article URL: http://ioccc.org/years.html

Comments URL: https://news.ycombinator.com/item?id=7009761

Points: 8

# Comments: 0

New comment by krzysz00 in "Clearer Conditionals using De Morgan's Laws"

krzysz00 — Fri, 20 Dec 2013 21:57:18 +0000

Not to drag the thread off topic, but this seems like the kind of situation where a version of Haskell's Maybe or Either monads might come in handy, so you could write:

    do
      command1
      command2
      ...

and have the failures propagate automatically.