⚡ Optimize fixp_distance with direct multiplication

[perim]

💡 What: Replaced the generic fixp_pow(value, 2u) calls in fixp_distance with direct multiplication (dx * dx + dy * dy).

🎯 Why: The previous implementation computed squared differences using fixp_pow, which involves a loop iterating over the exponent bits. For a constant exponent of 2, this overhead is entirely unnecessary. Direct multiplication is much faster, strictly cleaner, and functionally identical.

📊 Measured Improvement: We created a benchmark simulating 200,000,000 consecutive distance calculations.

• Baseline Time (Before optimization): ~0.947s
• Optimized Time: ~0.920s
• Improvement: The optimized code executes approximately 2.8% faster in the Release build. While small per call, this provides a completely safe, strict improvement to a highly localized, heavily utilized math primitive. All test assertions pass.

---

PR created automatically by Jules for task 6894842442942778521 started by @perim

[google-labs-jules]

👋 Jules, reporting for duty! I'm here to lend a hand with this pull request.

When you start a review, I'll add a 👀 emoji to each comment to let you know I've read it. I'll focus on feedback directed at me and will do my best to stay out of conversations between you and other bots or reviewers to keep the noise down.

I'll push a commit with your requested changes shortly after. Please note there might be a delay between these steps, but rest assured I'm on the job!

For more direct control, you can switch me to Reactive Mode. When this mode is on, I will only act on comments where you specifically mention me with @jules. You can find this option in the Pull Request section of your global Jules UI settings. You can always switch back!

New to Jules? Learn more at jules.google/docs.

---

For security, I will only act on instructions from the user who triggered this task.