Research Landing Title

Content for the Research landing page. for fancy stuff, see the infrastructure page.

Images zoom

We define the Square-Fibonacci sequence¹, a variation of the Fibonacci sequence:

Math

• Let $f_0 = 1, f_1 = 1$
• For $i \geq 2$, define $f_{i} := (f_{i-2})^2 + (f_{i-1})^2 \mod q$
  • Where $q$ is a large prime integer. We use this modulus to bound the size of each element, so that it can be represented by some predetermined number of bits.

Tables

Callouts

👍 Success

Vitae reprehenderit at aliquid error voluptates eum dignissimos.

Footnotes

Here’s a simple footnote,¹ and here’s a longer one.²