Feature/usability test feedback

app/dashboard/components/Information-icon-text.tsx

@@ -31,19 +31,18 @@ const TooltipWithIcon: React.FC<TooltipWithIconProps> = ({
     setIsOpen(true);
   };
 
-  const handleMouseLeave = () => {
-    setIsOpen(false);
-  };
-
   return (
     <TooltipProvider>
-      <Tooltip open={isOpen} onOpenChange={setIsOpen}>
+      <Tooltip
+        open={isOpen}
+        onOpenChange={setIsOpen}
+        disableHoverableContent={false}
+      >
         <TooltipTrigger asChild>
           <span
             className="ml-2 relative"
             onClick={handleClick}
             onMouseEnter={handleMouseEnter}
-            onMouseLeave={handleMouseLeave}
           >
             {/* Information Icon */}
             <FaInfoCircle className="text-primary cursor-pointer" size={18} />

app/dashboard/components/lazyload-view/index.tsx

@@ -1017,12 +1017,14 @@ function LazyLoadView() {
             You have selected the Winner - {winnerInfo.name}
           </h3>
           <p className="text-gray-700 mb-4">
-            The winner&apos;s elimination tree is typically very large and
-            complex, which may cause performance issues if displayed.
+            Since {winnerInfo.name} wasn’t eliminated, <br />
+            their tree simply follows the active path to victory.
+            <br />
+            To simplify the view, we’ve hidden the winner’s tree.
           </p>
           <p className="text-gray-700 mb-6">
-            Please select another candidate from the list above to view their
-            elimination tree instead.
+            If you’re curious, try selecting another candidate to explore how
+            they were eliminated along the way.
           </p>
           <div className="flex justify-center">
             <Button

app/dashboard/components/step-by-step-view/index.tsx

@@ -184,7 +184,7 @@ function StepByStepView({
           {(data.process[selectedStep] as any).treeUnchanged === true && (
             <p className="text-xs text-gray-500 italic mt-2">
               This assertion did{" "}
-              <span className="font-bold text-red-500">not</span> eliminate any
+              <span className="font-bold text-red-500">not</span> rule out any
               elimination orders.
             </p>
           )}

app/steps.tsx

@@ -145,11 +145,11 @@ export const getSteps = (candidateCount: number) => {
           <strong className="text-gray-500">Gray branches</strong>
           <Brown> are cut by assertions (scissors here), </Brown>
           <strong className="text-yellow-500">Yellow ones</strong>
-          <Brown>survive.</Brown>
+          <Brown> survive.</Brown>
           <br />
           <Brown>If someone wins, they’ve got </Brown>
           <strong className="text-blue-600"> at least one yellow path</strong>
-          <Brown> reaching the top—no cuts, no doubts!</Brown>
+          <Brown> reaching the top - no cuts, no doubts!</Brown>
           <TourNavButtons
             back={5}
             next={7}

app/tutorial/assertion/page.mdx

@@ -94,7 +94,7 @@ _and_
 
 This, again, is enough to prove that Alice won. To see why, consider the last elimination step. Alice must reach this step, because she cannot have been eliminated before Chuan or Diego. If Chuan or Diego is the other remaining candidate, Alice beats them (by the NEB assertion). The only other possibility is Bob—for this case, the NEN assertion shows that, in the last round, Alice beats Bob.
 
-### Visualizing assertions
+### Visualising assertions
 
 This reasoning can be visualized using elimination trees. For an audit, we need to disprove all elimination orders that result in a winner other than the announced winner.
 

app/tutorial/components/data-content.ts

@@ -8,12 +8,12 @@ export const contentData = [
     path: "/tutorial",
   },
   {
-    title: "Introduction: IRV RAs with RAIRE",
+    title: "Introduction: IRV RLAs with RAIRE",
     path: "/tutorial/introduction",
     subItems: ["The Audit Process from Beginning to End"],
   },
   {
-    title: "IRV elections and Visualizing Outcomes",
+    title: "IRV elections and Visualising Outcomes",
     path: "/tutorial/outcomes",
     subItems: ["How IRV Counts Work"],
   },
@@ -26,7 +26,7 @@ export const contentData = [
       "Simple assertions sometimes work",
       "One candidate dominates",
       "Two leading candidates",
-      "Visualizing assertions",
+      "Visualising assertions",
     ],
   },
   {

app/tutorial/introduction/page.md

@@ -1,4 +1,4 @@
-# Introduction: IRV RAs with RAIRE
+# Introduction: IRV RLAs with RAIRE
 
 Risk-Limiting Audits (RLAs) for Instant Runoff Voting (IRV) elections can be efficiently conducted using the RAIRE tool. RAIRE helps
 election administrators verify whether the announced winner in an IRV
@@ -18,7 +18,7 @@ for IRV by integrating RAIRE.
 1. Commit to the ballot manifest and CVRs.
 2. Choose contest(s) for audit.
 3. **Run RAIRE to generate assertions for audit.**
-4. **Use the RAIRE assertion validation and visualization module to check that the assertions imply the announced winner won.**
+4. **Use the RAIRE assertion validation and visualisation module to check that the assertions imply the announced winner won.**
 5. Generate a trustworthy random seed, e.g., by public dice rolling.
 6. Estimate the required sample size, based on the margin, **for each assertion**.
 7. Use the seed to generate the list of sampled ballots.

app/tutorial/outcomes/page.mdx

@@ -1,6 +1,6 @@
 import Image from "next/image";
 
-# IRV elections and Visualizing Outcomes
+# IRV elections and Visualising Outcomes
 
 Instant Runoff Voting (IRV) is a preferential voting system where voters
 rank candidates in order of preference. If no candidate receives a

test/prettyprint_assertions_and_pictures.test.ts

@@ -9,7 +9,7 @@
  * - Generating human-readable explanations of assertion effects
  * - NEB (Not Eliminated Before) and NEN (Not Eliminated Next) assertion handling
  *
- * These functions are crucial for visualizing how assertions eliminate
+ * These functions are crucial for visualising how assertions eliminate
  * possible election outcomes and prove a particular winner.
  */