digitalocean inferance 

doo_v1_2d9e530a43a2f57dde94e673b9b19763318a2a4b262a92b6ca03981784e1a1d9


//url

https://inference.do-ai.run/v1/chat/completions


const url = "https://inference.do-ai.run/v1/chat/completions";
const headers = {
    "Content-Type": "application/json",
    "Authorization": "Bearer YOUR_MODEL_ACCESS_KEY"
};
const data = {
    "model": "kimi-k3",
    "messages": [
        {
            "role": "user",
            "content": "What is the capital of France?"
        }
    ],
    "max_tokens": 100
};

INSERT multiple values with INSERT...SELECT method 

INSERT INTO "AgencyProperties" ("agencyId", "key", "value", "createdAt", "updatedAt")
SELECT
  id,
  'DRIVERS_LICENSE_COLLECTION_ENABLED',
  'true'::jsonb,
  now(),
  now()
FROM "Agencies"
WHERE id IN (
  112,
  131,
  150,
  384,
  433,
  446,
  476
);

dig ocean funcs 

personal access token
3rTU7erL6I0gfOimIOwajQdPT8QOKU0SG8qZZmSMekirxR1v6OQCQfZo5VyZYP3S

access key
dof_v1_db047988-74e6-4897-aa7e-b71b5625

2958. Length of Longest Subarray With at Most K Frequency

You are given an integer array nums and an integer k. The frequency of an element x is the number of times it occurs in an array. An array is called good if the frequency of each element in this array is less than or equal to k. Return the length of the longest good subarray of nums. A subarray is a contiguous non-empty sequence of elements within an array.
/**
 * @param {number[]} nums
 * @param {number} k
 * @return {number}
 */
var maxSubarrayLength = function(nums, k) {
    const freq = new Map();
    let l = 0;
    let best = 0;

    for (let r = 0; r < nums.length; r++) {
        const x = nums[r];
        freq.set(x, (freq.get(x) || 0) + 1);

        // If x exceeds k, shrink window
        while (freq.get(x) > k) {
            const y = nums[l];
            freq.set(y, freq.get(y) - 1);
            l++;
        }

        best = Math.max(be

Prompt 

Hello World!

Rotacion de los puntos sobre el mismo eje aleatorio 

Este Código va antes del copy to points junto con un Att randomize - Orient

vector axis = rand(@ptnum * 13.123);
axis = fit01(axis, -1, 1);
axis = normalize(axis);

float speed = fit01(rand(@ptnum * 91.77), chf("minspeed"), chf("maxspeed"));

float angle = @Time * speed;

vector4 q = quaternion(angle, axis);

// Add to existing orient
@orient = qmultiply(q, @orient);

images 


![](https://cdn.cacher.io/attachments/u/3hdxsw8uhic06/Ne2iI-NbroTfiLi9J6AZAff4f5Dd8sZs/wihcgdebp.png)

A complex, vintage Chicano tattoo-style graphic composition featuring a classic 90s luxury lowrider sedan cruising low through a Phoenix barrio summer night, wire spoke wheels shining, whitewall tires, chrome bumpers, and desert dust trailing behind it. Above the car looms a large menacing skull wearing aviator sunglasses and a snapback cap reading “PHX WESTSIDE,” surrounded by palm trees, sag

2996. Smallest Missing Integer Greater Than Sequential Prefix Sum

You are given a 0-indexed array of integers nums. A prefix nums[0..i] is sequential if, for all 1 <= j <= i, nums[j] = nums[j - 1] + 1. In particular, the prefix consisting only of nums[0] is sequential. Return the smallest integer x missing from nums such that x is greater than or equal to the sum of the longest sequential prefix.
/**
 * @param {number[]} nums
 * @return {number}
 */
var missingInteger = function(nums) {
    // Step 1: find longest sequential prefix
    let sum = nums[0];
    for (let i = 1; i < nums.length; i++) {
        if (nums[i] === nums[i - 1] + 1) {
            sum += nums[i];
        } else {
            break;
        }
    }

    // Step 2: find smallest missing integer >= sum
    const set = new Set(nums);
    let x = sum;
    while (set.has(x)) {
        x++;
    }
    return x;
};

Accordion component 

<accordion-group data-mode="single"> <!-- omit data-mode, or set "multiple", to allow several open at once -->
  <accordion-item>
    <button
        type="button"
        aria-expanded="false"
        aria-controls="panel-1"
        data-ref="trigger"
      >
        <span>Trigger label</span>
        <span data-ref="icon-closed" aria-hidden="true">+</span>
        <span data-ref="icon-open" aria-hidden="true" hidden>−</span>
      </button>

    <div id="panel-1" role="region" aria-labelledby=

Configuraciones Zorin OS para thinkpad T470

Comandos y configuraciones sugeridas por la IA de google para mejorar la instalación de Zorin OS en el thinkpad
# Cómo activar el lector de huellas en Zorin OS (Base Ubuntu)
# Añade el repositorio del driver específico
sudo add-apt-repository ppa:uunicorn/open-fprintd
sudo apt update
# Instala las herramientas de compatibilidad
sudo apt install open-fprintd fprintd-clients python3-validity
# Registra tu huella
fprintd-enroll
#--------------------------------------
# Un extra para la batería de tu ThinkPad
# Para gestionar la salud de ambas baterías de forma impecable en Linux, 
# una vez que estés dentro

more research 

# Build a Self-Improving Mastra Browser Agent

## Executive Summary

- **Model Name Correction**: Alibaba's current official flagship identifier is `qwen3.7-max`; I found no official `qwen3.8-max` listing. Qwen3.7-Max supports a 1M-token context window and a 65,536-token output limit [executive_summary[0]] [23]. -> Use `qwen3.7-max` now, but keep `QWEN_MODEL` configurable so you can change it when Alibaba actually publishes a newer identifier.
- **Fastest Browser Baseline**: Mastra has an offici

mastra research 

# Production Mastra for Agency Agent Delivery

## Executive Summary

- **Deterministic Boundaries**: Mastra agents decide which tools to call, how long to loop, and when to stop, while workflows define explicit multi-step control flow [executive_summary[0]] [11] -> make workflows the system of record for client delivery and use agents inside bounded steps.
- **Typed Capabilities**: Tools expose structured APIs with an id, description, input schema, output schema, and execute function [executive_

smithary 

{
  "Toolbox": {
    "type": "stdio",
    "command": "npx",
    "args": [
      "-y",
      "mcp-remote",
      "https://mcp.smithery.ai/pwdesignhtx"
    ]
  }
}

lm studio 

{
  "mcpServers": {
    "exa": {
      "url": "https://mcp.exa.ai/mcp?tools=web_search_exa,web_fetch_exa,agent_run,web_search_advanced_exa",
      "headers": {
        "x-api-key": "553c7346-dc41-4fe3-95b9-97cceb721ad1"
      }
    },
    "Parallel Task MCP": {
      "url": "https://task-mcp.parallel.ai/mcp"
    },
    "Parallel Search MCP": {
      "url": "https://search.parallel.ai/mcp"
    },
    "Context7": {
      "command": "npx",
      "args": [
        "-y",
        "@upstash/context7-mc

mastra research 

# Mastra

> Mastra is a framework for building AI-powered applications and agents with a modern TypeScript stack. It includes everything you need to go from early prototypes to production-ready applications. Mastra integrates with frontend and backend frameworks like React, Next.js, and Node, or you can deploy it anywhere as a standalone server. It's the easiest way to build, tune, and scale reliable AI products.

Below is a list of all available documentation pages.

## Docs

- [Get Sta

1510. Stone Game IV

Alice and Bob take turns playing a game, with Alice starting first. Initially, there are n stones in a pile. On each player's turn, that player makes a move consisting of removing any non-zero square number of stones in the pile. Also, if a player cannot make a move, he/she loses the game. Given a positive integer n, return true if and only if Alice wins the game otherwise return false, assuming both players play optimally.
/**
 * @param {number} n
 * @return {boolean}
 */
var winnerSquareGame = function(n) {
    // dp[i] represents whether the current player can win with i stones remaining.
    const dp = new Array(n + 1).fill(false);

    // Evaluate all positions from 1 to n.
    for (let i = 1; i <= n; i++) {

        // Try removing every possible square number s*s ≤ i.
        for (let s = 1; s * s <= i; s++) {

            // If removing s*s stones leaves the opponent in a losing position
            // then