Zapcopy QA Run 2026-04-27T00-03-45Z__iter_03

2026-04-27T00-03-45Z__iter_03

4/27/2026, 12:03:45 AM · 1 flow · 8,094ms total

⚠️
Settings differ from production defaults

This run used 1 setting that don't match the current app_defaults.yaml (asOf 2026-04-19).

Key Run value Default
promptSha256.photo "820549133fead0599675fdd9b0d19628c92aff77134dc48a845f9322013d01af" "48496a3017a2708a92d142281c5ab19f64f8132555514a00cbc35ca9d39daeba"
Build provenance
App
1.4·3
com.flashcopy.app.dev
Git
e0ead7ca32
feature/ocr-v2-structured-lambdas · dirty
Sim
AAC26DF1…
com.flashcopy.app.dev
Built at
4/26/2026, 11:49:50 PM
single-photo
v2 ok pipeline →
Input media
No media file found for this input.
code_screen_picture.JPG545.9 KBsha256 6b8b73d079
Input id
AAAA0011
Total
8.09s
Output
108 words
616 chars
Cost est
$0.00008
gemini-2.5-flash · basis: chars
in 433 · out 154 tok
Stage timings
local-vision
1.58s
moderation
755ms
s3-upload
684ms
gemini-ocr
5.08s
Stage details
local-vision
regions 21
conf 0.976
moderation
lambda moderation_ocr_v2
approved true
s3-upload
bucket qr-uploads-sup
key incoming/7d48cd13-0e41-49fd-8804-d921b8ec1abf.jpg
gemini-ocr
lambda moderation_ocr_v2
model gemini-2.5-flash
Extracted text
108 words · 616 chars
def is_prime(n):
"""
Checks if an integer 'n' is a prime number.

A prime number is a natural number greater than 1
that has no positive divisors other than 1 and itself.
"""

if n <= 1:
    return False
# Check for factors from 2 up to the square root of n
for i in range(2, int(math.sqrt(n)) + 1):
    if n % i == 0:
        return False
return True

def find_first_n_primes(count):
"""
FInds a specified count of the first prime numbers.
"""

primes = []
num = 2 # Start checking from the first prime candidate
while len(primes) < count:
    if is_prime(num):
        primes.append(num)
    num +=…
Raw Gemini response (v2)
parseable
690 chars — click to expand
{
  "ocr_text": "def is_prime(n):\n\"\"\"\nChecks if an integer 'n' is a prime number.\n\nA prime number is a natural number greater than 1\nthat has no positive divisors other than 1 and itself.\n\"\"\"\n\nif n <= 1:\n    return False\n# Check for factors from 2 up to the square root of n\nfor i in range(2, int(math.sqrt(n)) + 1):\n    if n % i == 0:\n        return False\nreturn True\n\ndef find_first_n_primes(count):\n\"\"\"\nFInds a specified count of the first prime numbers.\n\"\"\"\n\nprimes = []\nnum = 2 # Start checking from the first prime candidate\nwhile len(primes) < count:\n    if is_prime(num):\n        primes.append(num)\n    num += 1\nreturn primes",
  "notes": ""
}
Prompts used
all prompts →
photo_ocr gemini-2.5-flash 48496a3017… · 699 chars
Can you please OCR this image? Please OCR and do not modify the content and try and generate the OCR result with the same exact formatting as the input image. Please focus in ensuring the OCR process flawlessly retains the source's formatting. I aim to go line-by-line, capturing every detail, including special characters, comments, and those crucial line breaks, indentations, and case differences, thus guaranteeing the output mirrors the original. However, please remove any items from an editor or parts of the IDE/word processor that are shown in any potential screenshot to as just show only the content instead. (For instance removing the list of windows open/ line numbers, file name etc.)
qr_reader_v1/EXTENDED_LAMBDA_OCR.py:108
Diff+6 words6 words=102 unchanged·87.3% similar (by char)(prior run 2026-04-27T00-03-29Z__iter_02this run)
def is_prime(n):
    """
    
"""
Checks if an integer 'n' is a prime number.

    

A prime number is a natural number greater than 1
    
that has no positive divisors other than 1 and itself.
    """
    
"""

if n <= 1:
        
    return False
    
# Check for factors from 2 up to the square root of n
    
for i in range(2, int(math.sqrt(n)) + 1):
        
    if n % i == 0:
            
        return False
    
return True

def find_first_n_primes(count):
    """
    Finds
"""
FInds a specified count of the first prime numbers.
    """
    
"""

primes = []
    
num = 2 # Start checking from the first prime candidate
    
while len(primes) < count:
        
    if is_prime(num):
            primes.append(num)
        
        primes.append(num)
    num += 1
    
return primes
Run settings
Show all 5 values
{
  "rekognitionThreshold": 80,
  "geminiModel": "gemini-2.5-flash",
  "photoOcrPromptSha": "48496a3017a2708a92d142281c5ab19f64f8132555514a00cbc35ca9d39daeba",
  "frameOcrPromptSha": "66326cc5be6bdd434dbbdd330b519e26bd8bbcab4a6037a64c2148b66cd2aceb",
  "provenance": "pre-F1"
}