development.txt

<h2>Development</h2>

<h3>Source (git repository)</h3>

<p>You can get a clone of the git development repo with:</p> 

<pre>git clone https://github.com/flintlib/flint</pre> 
 
<p>If you want to browse the repository online, or fork it on GitHub, it can be accessed here:</p> 
<a href="https://github.com/flintlib/flint">https://github.com/flintlib/flint</a> 
 
<p>The current development branch within the repository is "main".</p> 

<h3>Community</h3>

<p>You are welcome to discuss FLINT on either of the following channels:</p>

<p>The <a href="https://groups.google.com/g/flint-devel">flint-devel mailing list</a>.</p>

<p>The <a href="https://sagemath.zulipchat.com/#narrow/stream/408539-flint">FLINT Zulip chat</a>.</p>

<p>Our GitHub issue tracker (for specific feature requests and bug reports): <a href="https://github.com/flintlib/flint/issues">https://github.com/flintlib/flint/issues</a>.</p>

<h3>Development ideas</h3>

<p>Here are some of ideas for development projects
that would be highly valuable to a large number of users.</p>

<ul>
<li>Improve FLINT's linear algebra performance using vectorization.</li>
<li>Write a tuning framework to automatically select algorithm thresholds on different architectures.</li>
<li>Work on assembly optimisations for specific architectures.</li>
<li>Sparse linear algebra.</li>
<li>Improve algorithms for dealing with exact algebraic and transcendental numbers.</li>
<li>Low-precision interval arithmetic.</li>
</ul>

<p>
A longer list of (mostly minor) issues to work on can be found in the
<a href="https://github.com/flintlib/flint/blob/trunk/todo.txt">todo.txt</a> file.
If you are interested in contributing to FLINT in any way,
or even just want to request a feature,
don't hesitate to leave a message on the mailing list!</p>

<h3>Job and internship opportunities</h3>

<p>
There may be openings for postdocs, PhD theses, master's theses, or research internships
relating to FLINT development.
Contact <a href="mailto:fredrik.johansson@gmail.com">Fredrik Johansson</a>
for more information.
</p>