by Zachary Hadd*
Despite decades of Federal Circuit precedent, a clear definiteness rubric for functional patent claims covering software inventions remains evasive. Questions persist on what constitutes sufficient structure to absolve these claims of means-plus-function treatment. The level of algorithmic specificity required to ensure definiteness for claims that are drafted in means-plus-function form is similarly abstruse. In this Contribution, Zachary Hadd (’21) argues that even software-specific “structure” is best interpreted under the means-plus-function framework and that according definiteness to anything less than step-by-step algorithmic de-tail is not only unjustified, but ultimately inconsistent with Federal Circuit precedent.