←back to thread

314 points whoishiring | 3 comments | | HN request time: 0.598s | source

Please state the location and include REMOTE for remote work, REMOTE (US) or similar if the country is restricted, and ONSITE when remote work is not an option.

Please only post if you personally are part of the hiring company—no recruiting firms or job boards. One post per company. If it isn't a household name, explain what your company does.

Please only post if you are actively filling a position and are committed to responding to applicants.

Commenters: please don't reply to job posts to complain about something. It's off topic here.

Readers: please only email if you are personally interested in the job.

Searchers: try https://dheerajck.github.io/hnwhoishiring/, http://nchelluri.github.io/hnjobs/, https://hnresumetojobs.com, https://hnhired.fly.dev, https://kennytilton.github.io/whoishiring/, https://hnjobs.emilburzo.com, or this (unofficial) Chrome extension: https://chromewebstore.google.com/detail/hn-hiring-pro/mpfal....

Don't miss this other fine thread: Who wants to be hired? https://news.ycombinator.com/item?id=46108940

Show context
hackmaxim[dead post] ◴[] No.46113042[source]
[flagged]
nrhrjrjrjtntbt ◴[] No.46113371[source]
Can you drop more info here on how it works. Before we go through sign up process.

Sounds quite easy to come up with such tasks. E.g. prove collatz conjecture. or write an O(log N) worst case sort. So there must be some boundaries.

The pay clearly isnt by hour so how is it worked out?

replies(1): >>46113456 #
hackmaxim ◴[] No.46113456[source]
Yes, of course!

Tasks must be coding problems to complete in a set of open-source repositories. We have eight repositories now and will add more in the future. You can source tasks by identifying merged commits into these repos, and making the following: - A well-defined task description (what should the AI do?) - A golden solution (can be sourced by the implementation in the merge commit) - A test patch (can be sourced from the merge commit, this is a testing suite that verifies whether the AI's solution is correct).

If you can make a task that is hard enough for our AI, you will get paid a fixed amount. That's it!

Once you are approved onto the site, there will be a more detailed tech spec + payment info + a tutorial.

replies(1): >>46113681 #
causal ◴[] No.46113681[source]
So this has to be a meaningful PR for the open source repository? You can't just invent arbitrary coding challenges?

This seems like trying to get free code contributions with a weird sort of gambling mechanic attached.

replies(2): >>46113769 #>>46115370 #
1. hackmaxim ◴[] No.46113769[source]
Nothing is free, of course, since we transparently pay per task (and as previously stated, the pay is very generous). There are certainly guidelines for what kinds of tasks you can submit to our platform, but beyond that, you can make any verifiable coding task in any of our qualifying open-source repositories.

We also definitely do not require you to write new code into the repo. As I said, you can adapt existing merged commits into coding tasks.

replies(1): >>46115843 #
2. nl ◴[] No.46115843[source]
How do we know in advance if something it going to be hard enough?

For example I have a bunch of closed PRs on my Vibe-Prolog project that took multiple attempts to get right: https://github.com/nlothian/Vibe-Prolog/pulls?q=is%3Apr+is%3...

As a specific example: https://github.com/nlothian/Vibe-Prolog/pull/214 which implements https://github.com/nlothian/Vibe-Prolog/issues/204

I'd be very interested if it is eligible!

replies(1): >>46117867 #
3. hackmaxim ◴[] No.46117867[source]
Something like this is reasonable. To clarify, we can't support arbitrary tasks yet on our submission platform; the tasks have to belong to a set of supported repositories. But tasks of this difficulty level generally tend to be hard enough.

You can't know for sure what is going to be the right difficulty in advance; however, you can definitely develop intuition for it as you make more tasks and better understand the model's strengths and weaknesses!