Skip to content
TrustedSkillsbeta
Back to all skills

Flow Next Prime

Checked
gmickel·vlatest·other·MIT

Predicts the next prime number in a sequence, aiding mathematical analysis and pattern recognition tasks.

Install on your platform

Showing Claude Code. One command installs this skill into any of the agents below.

  1. 1

    Run this in your project

    terminal
    $ npx skills add gmickel/flow-next --skill flow-next-prime -a claude-code
  2. Uses the open-source skills CLI and needs Node.js. Add -g to install it for your user instead of this project.

What we know about this skill

Publisher

gmickel

Taken from the source listing. We haven't verified who controls this account.

Install target

Live repository

Not pinned. Installing fetches whatever the repository holds at the time you run the command.

No human has reviewed this code. The checks below are a static scan of the files at one commit — nobody has run this skill or judged whether it works. A skill runs with whatever access you give your agent, so read the source before you install it.

Automated safety checks

scanned

This skill passed all 6 checks. We read its files at one commit and looked for the things that make a skill dangerous to run — not for whether it works.

  • Declares what it does: passed

    SKILL.md parses and declares a name and a description.

    SKILL.md exists, its frontmatter parses, and it declares a name and a description.

  • No undeclared network calls: passed

    Makes no network calls.

    Every host the skill dials — from its scripts, its config endpoints or the commands it tells the agent to run — is either well-known package and API infrastructure or declared in its own frontmatter. Links in documentation are not counted.

  • No obfuscated payloads: passed

    No encoded or obfuscated payloads.

    No base64, hex or compressed blob is decoded and then executed, and no encoded shell commands.

  • No credential access: passed

    Reads no keys, tokens, keychains or credential files.

    Neither the code nor the SKILL.md instructions read SSH keys, cloud credentials, keychains, token stores, browser cookie databases or dotfiles that hold secrets.

  • No pipe-to-shell installers: passed

    No pipe-to-shell or download-and-run installers.

    No `curl … | sh` pattern, in the code or in the instructions, that runs code fetched at run time.

  • Pinned to a commit: passed

    Scanned gmickel/gmickel-claude-marketplace at d61e3536f9.

    The exact upstream commit SHA that was scanned is recorded, so the result refers to specific bytes.

Scanned
15 files, 4,204 lines
Copies in repo
2 — all of them scanned
This is a static scan, not a review. It reads the skill's files; it does not run them, and it cannot tell you whether the skill is any good or whether the code does what its description says. A skill runs with whatever access you give your agent.
What each check looks for →

About this skill

What it does

This skill, flow-next-prime, calculates the next prime number following a given input. It efficiently determines primality and identifies the subsequent prime, providing a reliable solution for mathematical sequences or algorithmic tasks requiring prime numbers. The skill is designed to handle integer inputs and deliver accurate results.

When to use it

  • Generating prime number sequences for cryptographic applications.
  • Calculating prime numbers needed in mathematical algorithms or simulations.
  • Creating educational examples demonstrating prime number identification.
  • Verifying the correctness of other prime-related calculations.

Key capabilities

  • Prime Number Identification: Accurately determines if a given number is prime.
  • Next Prime Calculation: Efficiently finds the next prime number after an input.
  • Integer Input Handling: Accepts integer values as input for processing.

Example prompts

  • "What's the next prime number after 10?"
  • "Find the next prime following 79."
  • "Give me the prime number that comes after 23."

Tips & gotchas

The skill expects integer inputs; providing non-integer values may lead to unexpected results. While efficient, calculating very large primes can still take a noticeable amount of time.