diff --git a/tests/2_convex_hull/test.js b/tests/2_convex_hull/test.js
index 76c5295..64413a6 100644
--- a/tests/2_convex_hull/test.js
+++ b/tests/2_convex_hull/test.js
@@ -1,13 +1,9 @@
 export default {
   functionName: 'findConvexHull',
-  prompt: `
-// Your goal is to write a production-ready and maintainable JavaScript function. Apply code-golfing practices without sacrificing readability by putting everything on one line. Do not include any comments in your code.
-//
-// Write an async JavaScript function 'findConvexHull' that finds the convex hull of a set of 2D points using the Monotone Chain algorithm.
+  prompt: `// Write an async JavaScript function 'findConvexHull' that finds the convex hull of a set of 2D points using the Monotone Chain algorithm.
 // - The function must accept an array of points, e.g., [{x: 0, y: 3}, {x: 1, y: 1}, ...].
 // - You MUST use a dynamic import() to load the 'lodash' library from a CDN for sorting and uniqueness operations.
-// - The function should return an array of points representing the convex hull, ordered clockwise.
-`,
+// - The function should return an array of points representing the convex hull, ordered clockwise.`,
   runTest: async (findConvexHull) => {
     const assert = {
       deepStrictEqual: (a, e, m) => { if (JSON.stringify(a) !== JSON.stringify(e)) throw new Error(m) },