Skip to content
New issue

Have a question about this project? Sign up for a free GitHub account to open an issue and contact its maintainers and the community.

Sign up for GitHub

By clicking “Sign up for GitHub”, you agree to our terms of service and privacy statement. We’ll occasionally send you account related emails.

Already on GitHub? Sign in to your account

Extend bounty 3 to end of the third halvening #897

Merged
merged 2 commits into from
Dec 6, 2022
Merged

Extend bounty 3 to end of the third halvening #897

Changes from all commits
Commits
Show all changes
2 commits
Select commit Hold shift + click to select a range
e797373
Extend bounty 3 to end of the third halvening
casey Dec 6, 2022
bbda5ef
tweak
casey Dec 6, 2022
File filter

Filter by extension

Filter by extension
Conversations
Failed to load comments.
Loading
Jump to
Jump to file
Failed to load files.
Loading
Diff view
Diff view
9 changes: 5 additions & 4 deletions docs/src/bounty/3.md
View file
Open in desktop
Original file line number Diff line number Diff line change
Expand Up @@ -11,9 +11,9 @@ ordinal names get *shorter* as the ordinal number gets *longer*. The name of
ordinal 0, the first ordinal to be mined is `nvtdijuwxlp` and the name of
ordinal 2,099,999,997,689,999, the last ordinal to be mined, is `a`.

The bounty is open for submissions until block 766080—the first block of
difficulty adjustment period 380. Submissions included in block 766080 or later
will not be considered.
The bounty is open for submissions until block 840000—the first block after the
fourth halvening. Submissions included in block 840000 or later will not be
considered.

Both parts use [frequency.tsv](frequency.tsv), a list of words and the number
of times they occur in the [Google Books Ngram
Expand All @@ -24,7 +24,8 @@ corpus.

`frequency.tsv` is a file of tab-separated values. The first column is the
word, and the second is the number of times it appears in the corpus. The
entries are sorted from least-frequently occurring to most-frequently occuring.
entries are sorted from least-frequently occurring to most-frequently
occurring.

`frequency.tsv` was compiled using [this
program](https://github.com/casey/onegrams).
Expand Down