ForHosting KIT · Developer Utilities

Fibonacci coding converter

Fibonacci coding is a universal binary code that maps every positive integer to a unique bit string that always ends with two consecutive ones.

● BetaFree · in your browser
Use it from WebAPIEmailTelegramApp soon

The construction uses the Zeckendorf theorem: every positive integer is the sum of non-consecutive Fibonacci numbers from the sequence that begins one, two, three, five, eight, and so on. Place a one for each summand, a zero for each skipped basis term from F two upward, then append a final terminator bit so the code ends in eleven. Students of information theory, compression homework, and protocol designers who need a self-delimiting integer encoding use this converter to check examples without hand-building the Fibonacci table. The same pure algorithm powers the free browser tool and the paid API path, so a golden classroom example matches production automation byte for byte with no model and no network inside the solver.

How to use it

Enter your values in the form above. The tool checks them before calculating and shows the result on the same page.

Check your inputs

Use the labels and units shown next to each field. If something is missing or outside the allowed range, the page points to the field to fix.

Use it again or automate it

Use the browser tool for individual checks and the API when you need the same capability in an automated workflow.

Get an answer now

Enter one set of values and see the result without building a spreadsheet or script.

Compare scenarios

Change one value at a time and rerun the calculation to understand what affects the result.

Automate repeated work

Use the API when the same calculation needs to run inside your product or workflow.

How do I use this capability?

Complete the fields above and run it on this page. The form highlights anything that needs attention.

Everything on this page is available programmatically. This section is for teams who want to wire it into their own systems; everyone else can just use the tool above.

POSThttps://api.kit.forhosting.com/numth/fibonacci-coding

Prefer to automate it? One authenticated POST creates the task; the result comes back by webhook or a signed link. The same capability also runs here on the web, by email and from Telegram — and soon from our app too.

curl -X POST https://api.kit.forhosting.com/numth/fibonacci-coding \
  -H "Authorization: Bearer $KIT_KEY" \
  -H "Content-Type: application/json" \
  -d '{"n":6}'
{
  "n": 6
}
{
  "task_id": "tsk_a1b2c3d4e5f6a1b2c3d4e5f6",
  "type": "numth.fibonacci_coding",
  "status": "queued",
  "_links": {
    "result": "/tasks/tsk_…/result"
  }
}

The API is asynchronous: the call returns a task_id immediately and the result arrives by webhook. Polling is capped at 1 req/s per task.

Per request$0.002

Published price — no tokens, no invented credits. A failed task is never charged.

HTTPCodeMeaning
401unauthorizedMissing or invalid API key.
402insufficient_balanceYour balance doesn't cover the task price.
404unknown_typeThat task type doesn't exist.
429rate_limitedToo many requests. Use the webhook instead of polling.

Read the full KIT documentation →