Kwuang Tang

@karl-run I ran into this too, I think it's a problem w/ Next.js's SSR, the fix [here](https://github.com/vercel/next.js/discussions/14071 ) worked for me.

There's also a constant O(1) closed-form formula for the Nth fibonacci number - [Binet's Formula](http://www.maths.surrey.ac.uk/hosted-sites/R.Knott/Fibonacci/fibFormula.html#section1)

@enedil yes, you're correct. The matrix exponentiation would be more efficient from a CS point of view.

Just wondering, has there been any updates to the ranking/searching/indexing accuracy?

Agree with keeping it simple for now, we could also use Python3's built-in `asyncio` eg. - https://guillotina.readthedocs.io/en/latest/training/asyncio.html#long-running-tasks - https://faculty.ai/blog/a-guide-to-using-asyncio/

@nickmerwin thoughts?

Duplicate of #15

Duplicate of #77

Duplicate of #2

Duplicate of #5