Role Description & Scope
Executive Role Brief & Overview
This verified remote AI evaluation contract offers an immediate opportunity for specialized domain experts. Specialists are compensated at $65–$120/hr via direct weekly or bi-weekly settlements for all verified task submissions. Specialists selected for Code Complexity & Algorithm Performance Auditor execute structured AI Training & Data Curation audits, ensuring model outputs meet production-grade domain standards. Work entirely on your own schedule with 24/7 cloud benchmark access and flexible weekly hour commitments. Because cohort seats fill on a rolling basis, submit your profile early via our verified partner routing link to secure priority review.
- Primary Competency: AI Training & Data Curation
- Credential Tier: Vetted Domain Practitioner
- Candidate Profile: Ideal for Vetted Domain Practitioner domain specialists with sharp written communication and critical reasoning skills for frontier AI alignment.
- Verified Compensation: $65 - $120 / hr
What is the role overview and compensation benchmark for this position?
- Role Scope & Domain: Verified remote contract for Code Complexity & Algorithm Performance Auditor within the Finance & Accounting track on verified partner platforms.
- Direct Compensation: Rates range from $65 to $120 per hour (category benchmark average: $104/hr) with direct escrow disbursements.
- Work Structure: Fully remote, flexible scheduling with independent task execution.
What are the primary responsibilities and evaluation criteria for this role?
- Core Evaluation Tasks: Review and benchmark generative AI completions for factual accuracy, reasoning integrity, and compliance with project rubrics.
- Domain Focus: Apply specialized knowledge in analytical evaluation and rubric design to identify hallucinations, logic gaps, and edge-case errors.
- Grading Standards: Calibrate outputs against structured rubric criteria and maintain high inter-annotator agreement on partner evaluation batches.
Detailed Role Specifications & Project Scope
Benchmark mathematical algorithms, dynamic programming solutions, and computational complexity.\nResponsibilities:\n- Rigorously prove Big-O time and space complexity of generated algorithms.\n- Formulate LeetCode Hard / Competitive Programming level benchmark test suites.\n- Compare multiple algorithmic approaches (e.g. greedy vs DP vs divide-and-conquer).\nRequirements:\n- Strong Competitive Programming background (Codeforces, LeetCode, ACM-ICPC) or CS degree.\n- Mastery of advanced algorithms, graph theory, and mathematical proofs.