In Enfish, US 6,151,604 concerned a self-referential
data storage and retrieval system for a computer memory. The
invention improved the functioning of the computer by permitting
faster database searching, and by having more easily modified
database architecture.
At trial claim 17 was held invalid under 35 USC 101 for lack of
patent-eligible subject-matter; invalid under 35 USC 112 for
indefiniteness; and not infringed in any case. On appeal, the
Federal Circuit reversed on 35 USC 101 and on 35 USC 112, but
upheld the finding of non-infringement.
Somewhat ironically, the reversal on indefiniteness was also the
Plaintiff's undoing on infringement. The District Court
had found the "means for" language of claim 17
indefinite. The Federal Circuit held that the "means for"
was supported under 35 USC 112, 6th para., by a
three-step functional description in the specification. However,
when Enfish argued that the steps were optional permutations, and
so encompassed the