Skip to main content
Hugging FacePatent grant

Hugging Face was granted a patent for content-based data indexing.

What happened

In September 2026 Hugging Face patented a deduplication approach for organizing and comparing large datasets in software repositories and cloud storage.

Source

patents.google.comSep 15, 2026

US patent US12737323

Data indexing and deduplication using content-defined trees

Abstract

In some aspects, a computing system may generate a content-defined tree. A content-defined tree may be a tree of cryptographic hashes where each leaf is a hash of a chunk (e.g., data chunk) of a data object, and each parent node (e.g., interior node) is the hash of a concatenation of the hashes of the parent's children nodes. To create parent nodes for the leaf nodes, a computing system may group leaf nodes together based on a rolling hash (e.g., a rolling hash of the hashes of the leaf nodes) satisfying a condition. Each parent node may include a hash that represents the concatenation of the hashes of the leaf nodes that fall under the corresponding parent node.

patents.google.com/patent/US12737323Read the full source

Extracted by Autobound

From the Signal API record
Signal
Patent grant

What this signalsA new patent often shows where a company is putting its R&D budget.

Grant date
Sep 15, 2026
Inventors
3
Tech area
software / computing
Patent number
US12737323

The full record

From the Signal API record

People

  • Yucheng LowInventor
  • Ajit BanerjeeInventor
  • Rajat AryaInventor

Details

Primary CPC class
G06F 16/137 (Electric digital data processing)
USPTO assignee
HUGGING FACE, INC.
What the invention does
A method that breaks data into chunks, builds a tree of linked fingerprints, and uses those fingerprints to find duplicates efficiently.

Topics and mentions

Tags

  • Intellectual Property
  • Research & Development
  • Data Management
  • Cloud

Technologies named

  • data indexing
  • deduplication
  • cryptographic hashing
  • data trees

Extraction

Detected
Sep 20, 2026
signal_type
patents-company
signal_subtype
patentGrant

Use this data

Get every patent signal for Hugging Face and the companies you sell to, in the tools you already use.

  1. Ask Claude about it

    Connect Autobound to Claude, Claude Code or Cursor with MCP. Then ask: “What changed at Hugging Face this week?”

  2. Send it to your own tools

    The Signal API returns patent signals for any list of companies as JSON, for your CRM, warehouse or app.

  3. Try it free

    Sign up and spend your free credits on the companies you sell to.

    Start Free1,000 free credits

The API returns more than this page shows

This page shows a preview. The full patents-company record in the Signal API and MCP can also have these 8 fields. Some fields are empty for some signals.

Company

  • linkedin_urlValue in the API
  • industriesValue in the API
  • employee_count_lowValue in the API
  • employee_count_highValue in the API
  • revenueValue in the API
  • descriptionValue in the API

Signal

  • signal_nameValue in the API
  • associationValue in the API
Show the full JSONThe record on this page and the API request

GET /v1/signals/1ec9077e-fb61-511e-872b-42690727e9f2 returns this record as JSON. POST /v1/companies/enrich returns every signal for huggingface.co.

{
  "signal_id": "1ec9077e-fb61-511e-872b-42690727e9f2",
  "signal_type": "patents-company",
  "signal_subtype": "patentGrant",
  "detected_at": "2026-09-20T17:57:49+00:00",
  "company": {
    "name": "Hugging Face",
    "domain": "huggingface.co"
  },
  "data": {
    "cpc": [
      {
        "code": "G06F 16/137",
        "label": "Electric digital data processing"
      },
      {
        "code": "G06F 16/116",
        "label": "Electric digital data processing"
      },
      {
        "code": "G06F 16/185",
        "label": "Electric digital data processing"
      },
      {
        "code": "G06F 16/215",
        "label": "Electric digital data processing"
      },
      {
        "code": "G06F 16/2246",
        "label": "Electric digital data processing"
      }
    ],
    "tags": [
      "Intellectual Property",
      "Research & Development",
      "Data Management",
      "Cloud"
    ],
    "detail": "In September 2026 Hugging Face patented a deduplication approach for organizing and comparing large datasets in software repositories and cloud storage.",
    "summary": "Hugging Face was granted a patent for content-based data indexing.",
    "event_at": "2026-09-15",
    "inventors": [
      {
        "name": "Yucheng Low",
        "status": "resolved",
        "is_primary": true,
        "linkedin_url": "https://www.linkedin.com/in/yucheng-low-8baa0372"
      },
      {
        "name": "Ajit Banerjee",
        "status": "unresolved",
        "is_primary": false
      },
      {
        "name": "Rajat Arya",
        "status": "resolved",
        "is_primary": false,
        "linkedin_url": "https://www.linkedin.com/in/rajatarya"
      }
    ],
    "tech_area": "software / computing",
    "event_kind": "grant_date",
    "grant_date": "2026-09-15",
    "source_url": "https://patents.google.com/patent/US12737323",
    "cpc_primary": {
      "code": "G06F 16/137",
      "label": "Electric digital data processing"
    },
    "patent_title": "Data indexing and deduplication using content-defined trees",
    "patent_number": "US12737323",
    "uspto_assignee": "HUGGING FACE, INC.",
    "patent_abstract": "In some aspects, a computing system may generate a content-defined tree. A content-defined tree may be a tree of cryptographic hashes where each leaf is a hash of a chunk (e.g., data chunk) of a data object, and each parent node (e.g., interior node) is the hash of a concatenation of the hashes of the parent's children nodes. To create parent nodes for the leaf nodes, a computing system may group leaf nodes together based on a rolling hash (e.g., a rolling hash of the hashes of the leaf nodes) satisfying a condition. Each parent node may include a hash that represents the concatenation of the hashes of the leaf nodes that fall under the corresponding parent node.",
    "precision_class": "structural",
    "invention_explanation": "A method that breaks data into chunks, builds a tree of linked fingerprints, and uses those fingerprints to find duplicates efficiently.",
    "technologies_mentioned": [
      "data indexing",
      "deduplication",
      "cryptographic hashing",
      "data trees"
    ]
  }
}

Long text fields are shortened on this page.

Looking up one signal by its id is free. Enrich costs 2 credits per signal returned; a call with no results is free.