stillmade-sdk 0.1.42 → 0.1.43

package/blocks/native/sm.new-items/versions/1.0.0/package.js

@@ -1,191 +0,0 @@
-// Generated by scripts/build-owned-blocks.mjs. Edit the owned source files.
-export default {
-  "manifest": {
-    "schemaVersion": 1,
-    "sdkVersion": "0.1.0",
-    "id": "sm.new-items",
-    "version": "1.0.0",
-    "name": "Only new items",
-    "description": "Pass on one item an app returned that this automation has not handled yet, such as a new lead, order or message. It remembers what it has already passed on, so the same item is never handled twice; when nothing is new, the run stops here.",
-    "kind": "task",
-    "runtime": "javascript",
-    "license": "MIT",
-    "provenance": {
-      "notice": "Original source (authorship declared by the packager)\nLicense: MIT\nChanges: Original implementation declared by the packager; no reused repository or dependency code.\nFiles: LICENSE, src/run.js\n\nMIT License\n\nCopyright (c) 2026 StillMade contributors\n\nPermission is hereby granted, free of charge, to any person obtaining a copy of this software and associated documentation files (the \"Software\"), to deal in the Software without restriction, including without limitation the rights to use, copy, modify, merge, publish, distribute, sublicense, and/or sell copies of the Software, and to permit persons to whom the Software is furnished to do so, subject to the following conditions:\n\nThe above copyright notice and this permission notice shall be included in all copies or substantial portions of the Software.\n\nTHE SOFTWARE IS PROVIDED \"AS IS\", WITHOUT WARRANTY OF ANY KIND, EXPRESS OR IMPLIED, INCLUDING BUT NOT LIMITED TO THE WARRANTIES OF MERCHANTABILITY, FITNESS FOR A PARTICULAR PURPOSE AND NONINFRINGEMENT. IN NO EVENT SHALL THE AUTHORS OR COPYRIGHT HOLDERS BE LIABLE FOR ANY CLAIM, DAMAGES OR OTHER LIABILITY, WHETHER IN AN ACTION OF CONTRACT, TORT OR OTHERWISE, ARISING FROM, OUT OF OR IN CONNECTION WITH THE SOFTWARE OR THE USE OR OTHER DEALINGS IN THE SOFTWARE.\n",
-      "portableSources": [
-        {
-          "kind": "original",
-          "license": "MIT",
-          "paths": [
-            "LICENSE",
-            "src/run.js"
-          ],
-          "evidence": [
-            "upstream/0/LICENSE",
-            "upstream/0/src/run.js"
-          ],
-          "changes": "Original implementation declared by the packager; no reused repository or dependency code."
-        }
-      ]
-    },
-    "inputs": {
-      "items": {
-        "type": "object",
-        "primary": true,
-        "semantic": "external_data",
-        "required": true,
-        "description": "An app's result that contains a list, for example Meta Ads leads or Shopify orders.",
-        "schema": "object"
-      },
-      "id_field": {
-        "type": "text",
-        "default": "id",
-        "required": false,
-        "description": "The field that identifies each item. Most apps use id.",
-        "semantic": "item_id_field"
-      }
-    },
-    "outputs": {
-      "item": {
-        "type": "object",
-        "primary": true,
-        "semantic": "external_data",
-        "required": false,
-        "description": "The oldest item not handled yet. Missing when there is nothing new.",
-        "schema": "object"
-      },
-      "waiting": {
-        "type": "integer",
-        "required": false,
-        "description": "How many more new items are waiting for the next runs.",
-        "semantic": "pending_item_count"
-      }
-    },
-    "permissions": {
-      "project": [
-        "state.step"
-      ]
-    },
-    "state": {
-      "scope": "step",
-      "version": 1,
-      "initial": {
-        "seen": []
-      }
-    },
-    "ui": [
-      {
-        "port": "items",
-        "control": "text"
-      },
-      {
-        "port": "id_field",
-        "control": "text"
-      }
-    ]
-  },
-  "code": "const findList = (value, depth) => {\n  if (Array.isArray(value)) return value;\n  if (!value || typeof value !== 'object' || depth > 3) return null;\n  for (const key of ['data', 'items', 'results', 'records', 'leads', 'orders', 'messages', 'rows', 'value']) {\n    const found = findList(value[key], depth + 1);\n    if (found) return found;\n  }\n  for (const key of Object.keys(value)) {\n    if (Array.isArray(value[key])) return value[key];\n  }\n  for (const key of Object.keys(value)) {\n    const found = findList(value[key], depth + 1);\n    if (found) return found;\n  }\n  return null;\n};\nconst field = (input.id_field || 'id').trim() || 'id';\nconst list = (findList(input.items, 0) || []).filter(item => item && typeof item === 'object' && !Array.isArray(item));\nconst keyOf = item => item[field] === undefined || item[field] === null ? JSON.stringify(item) : String(item[field]);\nconst seen = new Set(state.seen);\n// Apps usually list newest first; handle the oldest new item first.\nconst fresh = list.filter(item => !seen.has(keyOf(item))).reverse();\nif (!fresh.length) return {};\nstate.seen = [...state.seen, keyOf(fresh[0])].slice(-2000);\nreturn { item: fresh[0], waiting: fresh.length - 1 };\n",
-  "tests": [
-    {
-      "name": "Passes the oldest new lead",
-      "input": {
-        "items": {
-          "data": [
-            {
-              "id": "3",
-              "name": "Cara"
-            },
-            {
-              "id": "2",
-              "name": "Ben"
-            },
-            {
-              "id": "1",
-              "name": "Ana"
-            }
-          ]
-        }
-      },
-      "state": {
-        "version": 1,
-        "value": {
-          "seen": [
-            "1"
-          ]
-        }
-      },
-      "expected": {
-        "item": {
-          "id": "2",
-          "name": "Ben"
-        },
-        "waiting": 1
-      },
-      "expectedState": {
-        "version": 1,
-        "value": {
-          "seen": [
-            "1",
-            "2"
-          ]
-        }
-      }
-    },
-    {
-      "name": "Stops when nothing is new",
-      "input": {
-        "items": {
-          "data": [
-            {
-              "id": "1"
-            }
-          ]
-        }
-      },
-      "state": {
-        "version": 1,
-        "value": {
-          "seen": [
-            "1"
-          ]
-        }
-      },
-      "expected": {},
-      "expectedState": {
-        "version": 1,
-        "value": {
-          "seen": [
-            "1"
-          ]
-        }
-      }
-    }
-  ],
-  "portable": {
-    "format": "stillmade-block/1",
-    "dependencies": [],
-    "sources": [
-      {
-        "kind": "original",
-        "license": "MIT",
-        "paths": [
-          "LICENSE",
-          "src/run.js"
-        ],
-        "evidence": [
-          "upstream/0/LICENSE",
-          "upstream/0/src/run.js"
-        ],
-        "changes": "Original implementation declared by the packager; no reused repository or dependency code."
-      }
-    ],
-    "files": {
-      "upstream/0/LICENSE": "MIT License\n\nCopyright (c) 2026 StillMade contributors\n\nPermission is hereby granted, free of charge, to any person obtaining a copy of this software and associated documentation files (the \"Software\"), to deal in the Software without restriction, including without limitation the rights to use, copy, modify, merge, publish, distribute, sublicense, and/or sell copies of the Software, and to permit persons to whom the Software is furnished to do so, subject to the following conditions:\n\nThe above copyright notice and this permission notice shall be included in all copies or substantial portions of the Software.\n\nTHE SOFTWARE IS PROVIDED \"AS IS\", WITHOUT WARRANTY OF ANY KIND, EXPRESS OR IMPLIED, INCLUDING BUT NOT LIMITED TO THE WARRANTIES OF MERCHANTABILITY, FITNESS FOR A PARTICULAR PURPOSE AND NONINFRINGEMENT. IN NO EVENT SHALL THE AUTHORS OR COPYRIGHT HOLDERS BE LIABLE FOR ANY CLAIM, DAMAGES OR OTHER LIABILITY, WHETHER IN AN ACTION OF CONTRACT, TORT OR OTHERWISE, ARISING FROM, OUT OF OR IN CONNECTION WITH THE SOFTWARE OR THE USE OR OTHER DEALINGS IN THE SOFTWARE.\n",
-      "upstream/0/src/run.js": "const findList = (value, depth) => {\n  if (Array.isArray(value)) return value;\n  if (!value || typeof value !== 'object' || depth > 3) return null;\n  for (const key of ['data', 'items', 'results', 'records', 'leads', 'orders', 'messages', 'rows', 'value']) {\n    const found = findList(value[key], depth + 1);\n    if (found) return found;\n  }\n  for (const key of Object.keys(value)) {\n    if (Array.isArray(value[key])) return value[key];\n  }\n  for (const key of Object.keys(value)) {\n    const found = findList(value[key], depth + 1);\n    if (found) return found;\n  }\n  return null;\n};\nconst field = (input.id_field || 'id').trim() || 'id';\nconst list = (findList(input.items, 0) || []).filter(item => item && typeof item === 'object' && !Array.isArray(item));\nconst keyOf = item => item[field] === undefined || item[field] === null ? JSON.stringify(item) : String(item[field]);\nconst seen = new Set(state.seen);\n// Apps usually list newest first; handle the oldest new item first.\nconst fresh = list.filter(item => !seen.has(keyOf(item))).reverse();\nif (!fresh.length) return {};\nstate.seen = [...state.seen, keyOf(fresh[0])].slice(-2000);\nreturn { item: fresh[0], waiting: fresh.length - 1 };\n"
-    },
-    "lineage": {
-      "parents": [],
-      "changes": "Packaged original Block source for StillMade."
-    }
-  }
-};

package/blocks/native/sm.pick-photos/versions/1.0.0/package.js

@@ -1,334 +0,0 @@
-// Generated by scripts/build-owned-blocks.mjs. Edit the owned source files.
-export default {
-  "manifest": {
-    "schemaVersion": 1,
-    "sdkVersion": "0.1.0",
-    "id": "sm.pick-photos",
-    "version": "1.0.0",
-    "name": "Pick best photos",
-    "description": "Check every photo with StillMade's vision capability and keep only the best ones: sharp, well lit, clear faces, varied, and true to your note.",
-    "kind": "task",
-    "runtime": "javascript",
-    "entry": "src/run.js",
-    "license": "MIT",
-    "provenance": {
-      "notice": "Original source (authorship declared by the packager)\nLicense: MIT\nChanges: Original implementation declared by the packager; no reused repository or dependency code.\nFiles: LICENSE, src/run.js\n\nMIT License\n\nCopyright (c) 2026 StillMade contributors\n\nPermission is hereby granted, free of charge, to any person obtaining a copy of this software and associated documentation files (the \"Software\"), to deal in the Software without restriction, including without limitation the rights to use, copy, modify, merge, publish, distribute, sublicense, and/or sell copies of the Software, and to permit persons to whom the Software is furnished to do so, subject to the following conditions:\n\nThe above copyright notice and this permission notice shall be included in all copies or substantial portions of the Software.\n\nTHE SOFTWARE IS PROVIDED \"AS IS\", WITHOUT WARRANTY OF ANY KIND, EXPRESS OR IMPLIED, INCLUDING BUT NOT LIMITED TO THE WARRANTIES OF MERCHANTABILITY, FITNESS FOR A PARTICULAR PURPOSE AND NONINFRINGEMENT. IN NO EVENT SHALL THE AUTHORS OR COPYRIGHT HOLDERS BE LIABLE FOR ANY CLAIM, DAMAGES OR OTHER LIABILITY, WHETHER IN AN ACTION OF CONTRACT, TORT OR OTHERWISE, ARISING FROM, OUT OF OR IN CONNECTION WITH THE SOFTWARE OR THE USE OR OTHER DEALINGS IN THE SOFTWARE.\n",
-      "portableSources": [
-        {
-          "kind": "original",
-          "license": "MIT",
-          "paths": [
-            "LICENSE",
-            "src/run.js"
-          ],
-          "evidence": [
-            "upstream/0/LICENSE",
-            "upstream/0/src/run.js"
-          ],
-          "changes": "Original implementation declared by the packager; no reused repository or dependency code."
-        }
-      ]
-    },
-    "inputs": {
-      "photos": {
-        "type": "image[]",
-        "primary": true,
-        "required": true,
-        "imageMode": "reference",
-        "description": "The photos to choose from, up to 100.",
-        "semantic": "image",
-        "accepts": [
-          "source_image"
-        ]
-      },
-      "keep": {
-        "type": "integer",
-        "default": 12,
-        "min": 1,
-        "max": 50,
-        "required": false,
-        "description": "How many photos to keep.",
-        "semantic": "photo_keep_count"
-      },
-      "instruction": {
-        "type": "text",
-        "default": "",
-        "required": false,
-        "description": "What the photos are for, such as: a memorial tribute for Grandma; prefer clear faces and happy moments.",
-        "semantic": "photo_selection_instruction"
-      },
-      "notes": {
-        "type": "json",
-        "required": false,
-        "description": "One note per photo from the photo check. StillMade fills this in when the Step runs; leave it empty.",
-        "semantic": "photo_notes",
-        "schema": [
-          {
-            "ok": "boolean?",
-            "sharp": "number?",
-            "light": "number?",
-            "people": "integer?",
-            "facesClear": "boolean?",
-            "smiling": "boolean?",
-            "eyesClosed": "boolean?",
-            "tags": "string[]?",
-            "text": "string?"
-          }
-        ]
-      }
-    },
-    "outputs": {
-      "photos": {
-        "type": "image[]",
-        "primary": true,
-        "description": "Only the chosen photos, unchanged, in the order they were taken when dates are known, otherwise best first.",
-        "semantic": "image"
-      },
-      "reasons": {
-        "type": "text",
-        "description": "Why each photo was kept.",
-        "semantic": "plain_text"
-      }
-    },
-    "permissions": {
-      "project": [],
-      "network": [],
-      "filesystem": [],
-      "secrets": []
-    },
-    "ui": [
-      {
-        "port": "photos",
-        "control": "asset"
-      },
-      {
-        "port": "keep",
-        "control": "number",
-        "label": "How many to keep"
-      },
-      {
-        "port": "instruction",
-        "control": "text",
-        "label": "What they are for"
-      },
-      {
-        "port": "photos",
-        "control": "gallery"
-      }
-    ],
-    "platforms": {
-      "phone": {
-        "supported": true
-      },
-      "browser": {
-        "supported": true
-      },
-      "desktop": {
-        "supported": true
-      }
-    }
-  },
-  "code": "// Pick best photos: rank the photos from their notes (one per photo, made by\n// Photo notes when the Step runs) and return only the chosen ones, unchanged.\nconst MAX_PHOTOS=100;\nconst photos=Array.isArray(input.photos)?input.photos:[];\nif(!photos.length)throw new Error('Add photos to choose from.');\nif(photos.length>MAX_PHOTOS)throw new Error('Pick best photos checks up to 100 photos at a time. You added '+String(photos.length)+'. Remove some, or split them into groups of 100 or fewer.');\nconst notes=Array.isArray(input.notes)?input.notes:null;\nif(!notes||notes.length!==photos.length)throw new Error('Pick best photos needs its photo check. Run this Step in your project to check the photos.');\nconst keep=Math.max(1,Math.min(50,Math.round(Number(input.keep)||12)));\nconst instruction=typeof input.instruction==='string'?input.instruction.toLowerCase():'';\n\nconst STOP=new Set(['the','and','for','with','that','this','from','into','our','her','his','their','them','who','are','was','were','has','have','had','want','like','prefer','some','more','most','very','only','photos','photo','pictures','picture','images','image','video','please','make','show','use','good','best','nice','tribute','about']);\nconst words=text=>String(text||'').toLowerCase().split(/[^a-z0-9]+/).filter(word=>word.length>=3&&!STOP.has(word));\nconst stem=word=>word.slice(0,5);\nconst wanted=[...new Set(words(instruction).map(stem))];\nconst wantsFaces=/face|people|person|portrait|family|everyone|group/.test(instruction);\nconst wantsHappy=/happy|smil|joy|laugh|fun|cheer/.test(instruction);\nconst wantsSharp=/clear|sharp|focus|quality/.test(instruction);\nconst level=value=>{const number=Number(value);return Number.isFinite(number)?Math.max(0,Math.min(10,number)):5;};\n\nconst notesFor=(note)=>{\n const ok=!!note&&typeof note==='object'&&note.ok!==false;\n const tags=Array.isArray(note&&note.tags)?note.tags.map(tag=>String(tag).toLowerCase()).slice(0,12):[];\n const text=String(note&&note.text||'');\n return {ok,sharp:level(note&&note.sharp),light:level(note&&note.light),people:Math.max(0,Math.min(50,Math.round(Number(note&&note.people)||0))),facesClear:note&&note.facesClear===true,smiling:note&&note.smiling===true,eyesClosed:note&&note.eyesClosed===true,tags,text,signature:new Set([...tags.flatMap(words),...words(text)].map(stem))};\n};\nconst fitOf=note=>{\n if(!wanted.length)return 0;\n let hits=0;for(const word of wanted)if(note.signature.has(word))hits++;\n return hits/wanted.length;\n};\nconst scoreOf=note=>{\n if(!note.ok)return -100;\n const quality=(note.sharp*.6+note.light*.4)/10;\n let score=3*quality+(note.people>0?1:0)+(note.facesClear?1.5:0)+(note.smiling?1:0)-(note.eyesClosed?1.5:0)+3*fitOf(note);\n if(wantsFaces)score+=(note.facesClear?1.5:0)+(note.people>0?1:0);\n if(wantsHappy)score+=note.smiling?2:0;\n if(wantsSharp)score+=2*quality;\n if(note.sharp<=2)score-=2;\n return Math.round(score*1000)/1000;\n};\nconst similarity=(a,b)=>{\n if(!a.signature.size||!b.signature.size)return 0;\n let shared=0;for(const word of a.signature)if(b.signature.has(word))shared++;\n return shared/(a.signature.size+b.signature.size-shared);\n};\nconst dateOf=photo=>{\n for(const key of ['takenAt','capturedAt','createdAt','date']){\n  const value=photo&&photo[key];\n  const time=typeof value==='number'?value:typeof value==='string'?Date.parse(value):NaN;\n  if(Number.isFinite(time))return time;\n }\n return null;\n};\n\n// Exact repeats of one saved version count once.\nconst seen=new Set();\nconst rows=[];\nphotos.forEach((photo,index)=>{\n const key=photo&&photo.assetId&&photo.versionId?photo.assetId+':'+photo.versionId:String(photo&&photo.url||index);\n if(seen.has(key))return;\n seen.add(key);\n const note=notesFor(notes[index]);\n rows.push({photo,index,note,score:scoreOf(note),fit:fitOf(note)});\n});\nconst ranked=rows.filter(row=>row.note.ok).sort((a,b)=>b.score-a.score||a.index-b.index);\nif(!ranked.length)throw new Error('None of these photos could be checked. Try clearer photos, or run the Step again.');\n\n// Near-duplicates (the same scene and people) give way to the best of them,\n// unless there are not enough different photos to fill the count.\nconst NEAR=.7;\nconst chosen=[],skipped=[];\nfor(const row of ranked){\n if(chosen.length>=keep)break;\n const twin=chosen.find(other=>Math.abs(other.note.people-row.note.people)<=1&&similarity(other.note,row.note)>=NEAR);\n if(twin){row.twin=twin;skipped.push(row);}else chosen.push(row);\n}\nfor(const row of skipped){if(chosen.length>=keep)break;chosen.push(row);}\n\nconst dated=chosen.every(row=>dateOf(row.photo)!==null);\nconst ordered=dated?chosen.slice().sort((a,b)=>dateOf(a.photo)-dateOf(b.photo)||a.index-b.index):chosen;\nconst nameOf=row=>row.photo&&typeof row.photo.name==='string'&&row.photo.name.trim()?row.photo.name.trim():'Photo '+String(row.index+1);\nconst why=row=>{\n const parts=[];\n const quality=(row.note.sharp*.6+row.note.light*.4);\n parts.push(quality>=7.5?'sharp and well lit':quality>=5?'clear enough':'the best of a weak set');\n if(row.note.people)parts.push(String(row.note.people)+(row.note.people===1?' person':' people'));\n if(row.note.facesClear)parts.push('clear faces');\n if(row.note.smiling)parts.push('smiling');\n if(row.fit>0)parts.push('fits your note');\n if(row.twin)parts.push('similar to another pick, kept to fill the count');\n return parts.join(', ');\n};\nconst lines=ordered.map((row,at)=>String(at+1)+'. '+nameOf(row)+': '+why(row)+'.');\nconst left=rows.length-chosen.length;\nconst header='Kept '+String(chosen.length)+' of '+String(photos.length)+' photos'+(dated?', in the order they were taken':', best first')+'.'+(left>0?' '+String(left)+' left out'+(skipped.length>chosen.filter(row=>row.twin).length?', some as near-duplicates':'')+'.':'');\nreturn {photos:ordered.map(row=>row.photo),reasons:[header,...lines].join('\\n')};\n",
-  "tests": [
-    {
-      "name": "keeps the sharpest varied photos and drops a near-duplicate",
-      "input": {
-        "photos": [
-          {
-            "kind": "image",
-            "assetId": "photo-1",
-            "versionId": "v1",
-            "url": "/api/media/photo-1"
-          },
-          {
-            "kind": "image",
-            "assetId": "photo-2",
-            "versionId": "v1",
-            "url": "/api/media/photo-2"
-          },
-          {
-            "kind": "image",
-            "assetId": "photo-3",
-            "versionId": "v1",
-            "url": "/api/media/photo-3"
-          },
-          {
-            "kind": "image",
-            "assetId": "photo-4",
-            "versionId": "v1",
-            "url": "/api/media/photo-4"
-          }
-        ],
-        "keep": 2,
-        "instruction": "Memorial tribute for Grandma; prefer clear faces",
-        "notes": [
-          {
-            "sharp": 9,
-            "light": 8,
-            "people": 2,
-            "facesClear": true,
-            "smiling": true,
-            "eyesClosed": false,
-            "tags": [
-              "grandma",
-              "garden",
-              "family"
-            ],
-            "text": "Two people smiling in a garden."
-          },
-          {
-            "sharp": 2,
-            "light": 3,
-            "people": 0,
-            "facesClear": false,
-            "smiling": false,
-            "eyesClosed": false,
-            "tags": [
-              "blur"
-            ],
-            "text": "A blurred hallway."
-          },
-          {
-            "sharp": 9,
-            "light": 8,
-            "people": 2,
-            "facesClear": true,
-            "smiling": true,
-            "eyesClosed": false,
-            "tags": [
-              "grandma",
-              "garden",
-              "family"
-            ],
-            "text": "Two people smiling in a garden."
-          },
-          {
-            "sharp": 8,
-            "light": 8,
-            "people": 1,
-            "facesClear": true,
-            "smiling": false,
-            "eyesClosed": false,
-            "tags": [
-              "kitchen",
-              "baking",
-              "grandma"
-            ],
-            "text": "A woman baking in a kitchen."
-          }
-        ]
-      },
-      "expected": {
-        "photos": [
-          {
-            "kind": "image",
-            "assetId": "photo-1",
-            "versionId": "v1",
-            "url": "/api/media/photo-1"
-          },
-          {
-            "kind": "image",
-            "assetId": "photo-4",
-            "versionId": "v1",
-            "url": "/api/media/photo-4"
-          }
-        ],
-        "reasons": "Kept 2 of 4 photos, best first. 2 left out, some as near-duplicates.\n1. Photo 1: sharp and well lit, 2 people, clear faces, smiling, fits your note.\n2. Photo 4: sharp and well lit, 1 person, clear faces, fits your note."
-      }
-    },
-    {
-      "name": "orders dated picks by when they were taken",
-      "input": {
-        "photos": [
-          {
-            "kind": "image",
-            "assetId": "photo-1",
-            "versionId": "v1",
-            "url": "/api/media/photo-1",
-            "takenAt": "2020-05-01T10:00:00Z"
-          },
-          {
-            "kind": "image",
-            "assetId": "photo-2",
-            "versionId": "v1",
-            "url": "/api/media/photo-2",
-            "takenAt": "2019-01-01T10:00:00Z"
-          }
-        ],
-        "keep": 2,
-        "notes": [
-          {
-            "sharp": 9,
-            "light": 9,
-            "people": 1,
-            "facesClear": true,
-            "smiling": true,
-            "eyesClosed": false,
-            "tags": [
-              "park"
-            ],
-            "text": "A child in a park."
-          },
-          {
-            "sharp": 6,
-            "light": 6,
-            "people": 0,
-            "facesClear": false,
-            "smiling": false,
-            "eyesClosed": false,
-            "tags": [
-              "lake"
-            ],
-            "text": "A quiet lake."
-          }
-        ]
-      },
-      "expected": {
-        "photos": [
-          {
-            "kind": "image",
-            "assetId": "photo-2",
-            "versionId": "v1",
-            "url": "/api/media/photo-2",
-            "takenAt": "2019-01-01T10:00:00Z"
-          },
-          {
-            "kind": "image",
-            "assetId": "photo-1",
-            "versionId": "v1",
-            "url": "/api/media/photo-1",
-            "takenAt": "2020-05-01T10:00:00Z"
-          }
-        ],
-        "reasons": "Kept 2 of 2 photos, in the order they were taken.\n1. Photo 2: clear enough.\n2. Photo 1: sharp and well lit, 1 person, clear faces, smiling."
-      }
-    }
-  ],
-  "portable": {
-    "format": "stillmade-block/1",
-    "dependencies": [],
-    "sources": [
-      {
-        "kind": "original",
-        "license": "MIT",
-        "paths": [
-          "LICENSE",
-          "src/run.js"
-        ],
-        "evidence": [
-          "upstream/0/LICENSE",
-          "upstream/0/src/run.js"
-        ],
-        "changes": "Original implementation declared by the packager; no reused repository or dependency code."
-      }
-    ],
-    "files": {
-      "upstream/0/LICENSE": "MIT License\n\nCopyright (c) 2026 StillMade contributors\n\nPermission is hereby granted, free of charge, to any person obtaining a copy of this software and associated documentation files (the \"Software\"), to deal in the Software without restriction, including without limitation the rights to use, copy, modify, merge, publish, distribute, sublicense, and/or sell copies of the Software, and to permit persons to whom the Software is furnished to do so, subject to the following conditions:\n\nThe above copyright notice and this permission notice shall be included in all copies or substantial portions of the Software.\n\nTHE SOFTWARE IS PROVIDED \"AS IS\", WITHOUT WARRANTY OF ANY KIND, EXPRESS OR IMPLIED, INCLUDING BUT NOT LIMITED TO THE WARRANTIES OF MERCHANTABILITY, FITNESS FOR A PARTICULAR PURPOSE AND NONINFRINGEMENT. IN NO EVENT SHALL THE AUTHORS OR COPYRIGHT HOLDERS BE LIABLE FOR ANY CLAIM, DAMAGES OR OTHER LIABILITY, WHETHER IN AN ACTION OF CONTRACT, TORT OR OTHERWISE, ARISING FROM, OUT OF OR IN CONNECTION WITH THE SOFTWARE OR THE USE OR OTHER DEALINGS IN THE SOFTWARE.\n",
-      "upstream/0/src/run.js": "// Pick best photos: rank the photos from their notes (one per photo, made by\n// Photo notes when the Step runs) and return only the chosen ones, unchanged.\nconst MAX_PHOTOS=100;\nconst photos=Array.isArray(input.photos)?input.photos:[];\nif(!photos.length)throw new Error('Add photos to choose from.');\nif(photos.length>MAX_PHOTOS)throw new Error('Pick best photos checks up to 100 photos at a time. You added '+String(photos.length)+'. Remove some, or split them into groups of 100 or fewer.');\nconst notes=Array.isArray(input.notes)?input.notes:null;\nif(!notes||notes.length!==photos.length)throw new Error('Pick best photos needs its photo check. Run this Step in your project to check the photos.');\nconst keep=Math.max(1,Math.min(50,Math.round(Number(input.keep)||12)));\nconst instruction=typeof input.instruction==='string'?input.instruction.toLowerCase():'';\n\nconst STOP=new Set(['the','and','for','with','that','this','from','into','our','her','his','their','them','who','are','was','were','has','have','had','want','like','prefer','some','more','most','very','only','photos','photo','pictures','picture','images','image','video','please','make','show','use','good','best','nice','tribute','about']);\nconst words=text=>String(text||'').toLowerCase().split(/[^a-z0-9]+/).filter(word=>word.length>=3&&!STOP.has(word));\nconst stem=word=>word.slice(0,5);\nconst wanted=[...new Set(words(instruction).map(stem))];\nconst wantsFaces=/face|people|person|portrait|family|everyone|group/.test(instruction);\nconst wantsHappy=/happy|smil|joy|laugh|fun|cheer/.test(instruction);\nconst wantsSharp=/clear|sharp|focus|quality/.test(instruction);\nconst level=value=>{const number=Number(value);return Number.isFinite(number)?Math.max(0,Math.min(10,number)):5;};\n\nconst notesFor=(note)=>{\n const ok=!!note&&typeof note==='object'&&note.ok!==false;\n const tags=Array.isArray(note&&note.tags)?note.tags.map(tag=>String(tag).toLowerCase()).slice(0,12):[];\n const text=String(note&&note.text||'');\n return {ok,sharp:level(note&&note.sharp),light:level(note&&note.light),people:Math.max(0,Math.min(50,Math.round(Number(note&&note.people)||0))),facesClear:note&&note.facesClear===true,smiling:note&&note.smiling===true,eyesClosed:note&&note.eyesClosed===true,tags,text,signature:new Set([...tags.flatMap(words),...words(text)].map(stem))};\n};\nconst fitOf=note=>{\n if(!wanted.length)return 0;\n let hits=0;for(const word of wanted)if(note.signature.has(word))hits++;\n return hits/wanted.length;\n};\nconst scoreOf=note=>{\n if(!note.ok)return -100;\n const quality=(note.sharp*.6+note.light*.4)/10;\n let score=3*quality+(note.people>0?1:0)+(note.facesClear?1.5:0)+(note.smiling?1:0)-(note.eyesClosed?1.5:0)+3*fitOf(note);\n if(wantsFaces)score+=(note.facesClear?1.5:0)+(note.people>0?1:0);\n if(wantsHappy)score+=note.smiling?2:0;\n if(wantsSharp)score+=2*quality;\n if(note.sharp<=2)score-=2;\n return Math.round(score*1000)/1000;\n};\nconst similarity=(a,b)=>{\n if(!a.signature.size||!b.signature.size)return 0;\n let shared=0;for(const word of a.signature)if(b.signature.has(word))shared++;\n return shared/(a.signature.size+b.signature.size-shared);\n};\nconst dateOf=photo=>{\n for(const key of ['takenAt','capturedAt','createdAt','date']){\n  const value=photo&&photo[key];\n  const time=typeof value==='number'?value:typeof value==='string'?Date.parse(value):NaN;\n  if(Number.isFinite(time))return time;\n }\n return null;\n};\n\n// Exact repeats of one saved version count once.\nconst seen=new Set();\nconst rows=[];\nphotos.forEach((photo,index)=>{\n const key=photo&&photo.assetId&&photo.versionId?photo.assetId+':'+photo.versionId:String(photo&&photo.url||index);\n if(seen.has(key))return;\n seen.add(key);\n const note=notesFor(notes[index]);\n rows.push({photo,index,note,score:scoreOf(note),fit:fitOf(note)});\n});\nconst ranked=rows.filter(row=>row.note.ok).sort((a,b)=>b.score-a.score||a.index-b.index);\nif(!ranked.length)throw new Error('None of these photos could be checked. Try clearer photos, or run the Step again.');\n\n// Near-duplicates (the same scene and people) give way to the best of them,\n// unless there are not enough different photos to fill the count.\nconst NEAR=.7;\nconst chosen=[],skipped=[];\nfor(const row of ranked){\n if(chosen.length>=keep)break;\n const twin=chosen.find(other=>Math.abs(other.note.people-row.note.people)<=1&&similarity(other.note,row.note)>=NEAR);\n if(twin){row.twin=twin;skipped.push(row);}else chosen.push(row);\n}\nfor(const row of skipped){if(chosen.length>=keep)break;chosen.push(row);}\n\nconst dated=chosen.every(row=>dateOf(row.photo)!==null);\nconst ordered=dated?chosen.slice().sort((a,b)=>dateOf(a.photo)-dateOf(b.photo)||a.index-b.index):chosen;\nconst nameOf=row=>row.photo&&typeof row.photo.name==='string'&&row.photo.name.trim()?row.photo.name.trim():'Photo '+String(row.index+1);\nconst why=row=>{\n const parts=[];\n const quality=(row.note.sharp*.6+row.note.light*.4);\n parts.push(quality>=7.5?'sharp and well lit':quality>=5?'clear enough':'the best of a weak set');\n if(row.note.people)parts.push(String(row.note.people)+(row.note.people===1?' person':' people'));\n if(row.note.facesClear)parts.push('clear faces');\n if(row.note.smiling)parts.push('smiling');\n if(row.fit>0)parts.push('fits your note');\n if(row.twin)parts.push('similar to another pick, kept to fill the count');\n return parts.join(', ');\n};\nconst lines=ordered.map((row,at)=>String(at+1)+'. '+nameOf(row)+': '+why(row)+'.');\nconst left=rows.length-chosen.length;\nconst header='Kept '+String(chosen.length)+' of '+String(photos.length)+' photos'+(dated?', in the order they were taken':', best first')+'.'+(left>0?' '+String(left)+' left out'+(skipped.length>chosen.filter(row=>row.twin).length?', some as near-duplicates':'')+'.':'');\nreturn {photos:ordered.map(row=>row.photo),reasons:[header,...lines].join('\\n')};\n"
-    },
-    "lineage": {
-      "parents": [],
-      "changes": "Packaged original Block source for StillMade."
-    }
-  }
-};