In this work we give the first proof that Trace Hermitian codes have vanishing bias.
This, and following work, bring to the front the question of the true behavior of Trace AG codes, and the fascinating possibility that they might match, perhaps even surpass, the GV bound.

We rewrote many sections, added a section on additive characters and rewrote the introduction

The Stepanov-Bombieri proof of the Hasse-Weil bound also gives non-trivial bounds on the bias of character sums over curves with small genus, for any low-degree function $f$ that is not completely biased. For high genus curves, and in particular for curves used in AG codes over constant size fields, the technique fails to prove any non-trivial result.

We significantly strengthen the Stepanov-Bombieri approach and obtain strong bounds on the bias of character sums over high genus curves. For example, we show that the bias of the quadratic character over the Hermitian function field is small, for any low-degree function $f$ with odd degree. Our results also give non-trivial results for the first levels of the Hermitian tower.

Technique-wise we analyze multiplicity in function fields in a better way, using a new 'universal derivative-fix' lemma we prove, building on the connection between derivatives and differentials in function fields.