We show new tradeoffs for satisfiability and nondeterministic
linear time. Satisfiability cannot be solved on general purpose
random-access Turing machines in time n^{1.618} and space
n^{o(1)}. This improves recent results of Lipton and Viglas and
Fortnow.