2026-04-25T16-06-50Z__iter_03

4/25/2026, 4:06:50 PM · 1 flow · 23,498ms 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	"c60fcca3dad478ed36d1bc28445c1e3529344078ec40ca170cc4fc2c29c4ba7a"	"48496a3017a2708a92d142281c5ab19f64f8132555514a00cbc35ca9d39daeba"

Build provenance

App

1.4·3

com.flashcopy.app.dev

Git

321150070a

feature/ocr-v2-structured-lambdas · dirty

Sim

AAC26DF1…

com.flashcopy.app.dev

Built at

4/25/2026, 4:01:26 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

23.50s

Output

108 words

704 chars

Cost est

$0.00009

gemini-2.5-flash · basis: chars

in 433 · out 176 tok

Stage timings

local-vision

1.33s

moderation

311ms

s3-upload

651ms

gemini-ocr

21.20s

Stage details

local-vision	regions 21 conf 0.976
moderation	lambda moderation_ocr_v2 approved true
s3-upload	bucket qr-uploads-sup key incoming/c0ccaf1a-56e0-4be5-984c-abaf340cfd6b.jpg
gemini-ocr	lambda moderation_ocr_v2 model gemini-2.5-flash

Extracted text

108 words · 704 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(prim…

Raw Gemini response (v2)

parseable

863 chars — click to expand

{"ocr_text": "def is_prime(n):\n    \"\"\"\n    Checks if an integer 'n' is a prime number.\n\n    A prime number is a natural number greater than 1\n    that has no positive divisors other than 1 and itself.\n    \"\"\"\n\n    if n <= 1:\n        return False\n    # Check for factors from 2 up to the square root of n\n    for i in range(2, int(math.sqrt(n)) + 1):\n        if n % i == 0:\n            return False\n    return True\n\n\ndef find_first_n_primes(count):\n    \"\"\"\n    Finds a specified count of the first prime numbers.\n    \"\"\"\n    primes = []\n    num = 2 # Start checking from the first prime candidate\n    while len(primes) < count:\n        if is_prime(num):\n            primes.append(num)\n        num += 1\n    return primes", "notes": "Would have added 'import math' at the top of the file for the 'math.sqrt' function to work."}

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

Output diff

vs 2026-04-25T16-06-19Z__iter_02

Diff+0 words−0 words=108 unchanged·100.0% similar (by char)(prior run 2026-04-25T16-06-19Z__iter_02 → this 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 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 += 1
    return primes

Run settings

Show all 5 values

{
  "rekognitionThreshold": 80,
  "geminiModel": "gemini-2.5-flash",
  "photoOcrPromptSha": "48496a3017a2708a92d142281c5ab19f64f8132555514a00cbc35ca9d39daeba",
  "frameOcrPromptSha": "66326cc5be6bdd434dbbdd330b519e26bd8bbcab4a6037a64c2148b66cd2aceb",
  "provenance": "post-F1"
}