Repository Analysis

microsoft/ebpf-for-windows

eBPF implementation that runs on top of Windows

11.3 Low AI signal View on GitHub

Analysis Overview

This report presents the forensic synthetic code analysis of microsoft/ebpf-for-windows, a C project with 3,538 GitHub stars. SynthScan v2.0 examined 343,925 lines of code across 803 source files, recording 5349 pattern matches distributed across 7 syntactic categories. The overall adjusted score of 11.3 places this repository in the Low AI signal band.

The scanner applied 160+ deterministic lexical heuristics, multi-line block detectors, abstract syntax tree depth profilers, and a cross-file Jaccard similarity matrix to construct a statistically normalised synthetic code estimate. All matches are individually weighted by severity coefficient and contextual multiplier before summation, and the resulting headline score is temporally discounted to account for the repository's development history relative to the commercial emergence of large language model coding tooling (November 2022 onward).

11.3
Adjusted Score
11.3
Raw Score
100%
Time Factor
2026-08-08
Last Push
3.5K
Stars
C
Language
343.9K
Lines of Code
803
Files
5.3K
Pattern Hits
2026-08-09
Scan Date
0.00
HC Hit Rate

What These Metrics Mean

Adjusted Score
Primary synthetic code indicator. Raw score normalised per 1,000 lines of code and multiplied by the temporal discount factor. This is the definitive comparative metric — use it to rank repositories by AI authorship density.
Raw Score
The unmodified sum of all severity-weighted, context-multiplied pattern match scores before temporal discounting. Reflects the absolute signal strength independent of when the repository was last active.
Time Factor
The temporal discount multiplier (0–100%) applied to the raw score. Repositories last updated before ChatGPT's launch (Nov 2022) receive a 5% factor. Full signal is only assigned to repositories active in the post-adoption era (Jan 2024+).
Pattern Hits
Total count of individual pattern matches across all files and categories. A high hit count with a low score may indicate a very large codebase with isolated AI snippets; a low count with a high score indicates dense, concentrated AI signatures.
HC Hit Rate
High+Critical pattern hits per file, averaged across the repository. This orthogonal signal catches repositories where a few files are densely packed with high-severity AI tells — a strong indicator even when the normalised score appears moderate due to codebase size.
Lines of Code / Files
Total lines and files analysed. The scanner examines 94 file extensions. These denominators are used to normalise the score, enabling fair comparison between repositories of vastly different sizes.

Score History

Longitudinal tracking requires multiple scan runs. Once this repository is re-scanned after new commits land, this chart will visualise how the synthetic code signal evolves over time — enabling you to detect whether AI authorship is growing, stabilising, or being actively corrected by human engineers.

No multi-scan history yet — run the scanner again to build trend data.

Severity Breakdown

Classifies detected patterns by their diagnostic confidence and structural impact. CRITICAL patterns (coefficient 10) represent definitive synthetic signatures — hallucinated imports, explicit LLM attribution metadata — virtually never produced by human authors. HIGH (5) indicates strong structural tells such as cross-file repetition or cross-linguistic idioms. MEDIUM (2) covers recognisable conversational padding and AI-specific vocabulary. LOW (1) captures subtle indicators like tautological comments and generic boilerplate that require density to carry independent signal.

CRITICAL 3HIGH 0MEDIUM 7LOW 5339

Directory Score Breakdown

This horizontal bar chart decomposes the repository's raw synthetic code score by top-level directory, allowing you to pinpoint precisely which modules or components carry the highest AI authorship density. Directories with disproportionately high scores relative to their size warrant targeted manual review: concentrated AI signatures often trace back to mass-generated configuration layers, auto-ported test suites, LLM-scaffolded boilerplate classes, or entire subsystems authored under heavy copilot assistance. Use this view to prioritise your human code-review effort.

Pattern Findings

The scanner identified 5349 distinct pattern matches across 7 syntactic categories. Each entry below represents a discrete location in the source code where the engine recorded a statistically significant AI authorship indicator. Expand any category row to inspect the individual file paths, line numbers, code snippets, and the lexical context (CODE, COMMENT, or STRING) in which each match was detected.

Reading the findings table: The Severity column indicates the diagnostic confidence level (CRITICAL / HIGH / MEDIUM / LOW). The Context column identifies whether the match occurred inside executable code, an inline comment, or a string literal — comment-context matches receive a ×1.5 weight because LLMs systematically over-annotate. The ⚡ bolt icon marks clustered matches: three or more patterns within a 10-line window, each receiving an additional ×1.5 density multiplier as dense clusters constitute far stronger evidence of synthetic authorship than isolated hits.

Over-Commented Block5285 hits · 3750 pts
SeverityFileLineSnippetContext
LOWtools/export_program_info/export_program_info.cpp1// Copyright (c) eBPF for Windows contributorsCOMMENT
LOWtools/export_program_info/resource.h1// Copyright (c) eBPF for Windows contributorsCOMMENT
LOWtools/bpf2c/bpf2c.cpp1// Copyright (c) eBPF for Windows contributorsCOMMENT
LOWtools/bpf2c/bpf_code_generator.cpp1// Copyright (c) eBPF for Windows contributorsCOMMENT
LOWtools/bpf2c/bpf_code_generator.cpp21#define ebpf_inst ebpf_inst_btfCOMMENT
LOWtools/bpf2c/bpf_code_generator.cpp41// See: https://github.com/vbpf/prevail/issues/876COMMENT
LOWtools/bpf2c/bpf_code_generator.cpp61#define EBPF_ATOMIC_ADD 0x00COMMENT
LOWtools/bpf2c/bpf_code_generator.h1// Copyright (c) eBPF for Windows contributorsCOMMENT
LOWtools/bpf2c/resource.h1// Copyright (c) eBPF for Windows contributorsCOMMENT
LOWtools/netsh/resource.h1//{{NO_DEPENDENCIES}}COMMENT
LOWtools/netsh/resource.h21#define HLP_EBPF_SHOW_LINKS 117COMMENT
LOWtools/netsh/resource.h41// Next default values for new objects.COMMENT
LOWtools/netsh/dllmain.c1// Copyright (c) eBPF for Windows contributorsCOMMENT
LOWtools/netsh/dllmain.c41#define CMD_GROUP_SHOW L"show"COMMENT
LOWtools/netsh/dllmain.c181#define HLP_GROUP_SET 1104COMMENT
LOWtools/bpftool/resource.h1// Copyright (c) eBPF for Windows contributorsCOMMENT
LOWtools/port_leak/resource.h1// Copyright (c) eBPF for Windows contributorsCOMMENT
LOWtools/dnsflood/resource.h1// Copyright (c) eBPF for Windows contributorsCOMMENT
LOWtools/port_quota/resource.h1// Copyright (c) eBPF for Windows contributorsCOMMENT
LOWebpfapi/rpc_client.cpp1// Copyright (c) eBPF for Windows contributorsCOMMENT
LOWebpfapi/resource.h1// Copyright (c) eBPF for Windows contributorsCOMMENT
LOWinclude/bpf_endian.h41 * to cpu_to_be16(). We could use it unconditionally in BPFCOMMENT
LOWinclude/bpf_endian.h61#define __bpf_htons(x) (x)COMMENT
LOWinclude/bpf_endian.h81#define bpf_be64_to_cpu(x) (__builtin_constant_p(x) ? __bpf_constant_be64_to_cpu(x) : __bpf_be64_to_cpu(x))COMMENT
LOWinclude/ebpf_windows.h1// Copyright (c) eBPF for Windows contributorsCOMMENT
LOWinclude/ebpf_windows.h21typedef unsigned short uint16_t;COMMENT
LOWinclude/ebpf_windows.h41#define EBPF_GLOBAL_HELPERS_REGISTRY_KEY L"GlobalHelpers"COMMENT
LOWinclude/ebpf_windows.h81#define EBPF_ATTACH_CLIENT_DATA_VERSION_TOTAL_SIZE sizeof(ebpf_extension_data_t)COMMENT
LOWinclude/ebpf_error.h1// Copyright (c) eBPF for Windows contributorsCOMMENT
LOWinclude/ebpf_program_types.h1// Copyright (c) eBPF for Windows contributorsCOMMENT
LOWinclude/bpf_helpers_platform.h1// Copyright (c) eBPF for Windows contributorsCOMMENT
LOWinclude/bpf2c.h21#elseCOMMENT
LOWinclude/bpf2c.h61COMMENT
LOWinclude/bpf_helpers.h1// Copyright (c) eBPF for Windows contributorsCOMMENT
LOWinclude/bpf_helpers.h41COMMENT
LOWinclude/bpf_helper_defs.h201EBPF_HELPER(long, bpf_trace_printk5, (const char* fmt, uint32_t fmt_size, uint64_t arg3, uint64_t arg4, uint64_t arg5));COMMENT
LOWinclude/bpf_helper_defs.h481#define bpf_strnlen_s ((bpf_strnlen_s_t)BPF_FUNC_strnlen_s)COMMENT
LOWinclude/elfio_wrapper.hpp1// Copyright (c) eBPF for Windows contributorsCOMMENT
LOWinclude/ebpf_nethooks.h1// Copyright (c) eBPF for Windows contributorsCOMMENT
LOWinclude/ebpf_nethooks.h341#pragma warning(pop)COMMENT
LOWinclude/ebpf_api.h1// Copyright (c) eBPF for Windows contributorsCOMMENT
LOWinclude/uapi/linux/tcp.h1// Copyright (c) eBPF for Windows contributorsCOMMENT
LOWinclude/uapi/linux/bpf.h1// Copyright (c) eBPF for Windows contributorsCOMMENT
LOWinclude/uapi/linux/if_ether.h1// Copyright (c) eBPF for Windows contributorsCOMMENT
LOWinclude/uapi/linux/in.h1// Copyright (c) eBPF for Windows contributorsCOMMENT
LOWinclude/uapi/linux/ip.h1// Copyright (c) eBPF for Windows contributorsCOMMENT
LOWinclude/asm/posix_types.h1// Copyright (c) eBPF for Windows contributorsCOMMENT
LOWinclude/asm/errno.h1// Copyright (c) eBPF for Windows contributorsCOMMENT
LOWinclude/net/if_ether.h21 uint16_t Length; // IEEE 802COMMENT
LOWinclude/net/ip.h1// Copyright (c) eBPF for Windows contributorsCOMMENT
LOWinclude/bpf_conformance/bpf_conformance.h1// Copyright (c) eBPF for Windows contributorsCOMMENT
LOWinclude/linux/bpf.h1// Copyright (c) eBPF for Windows contributorsCOMMENT
LOWinclude/linux/stddef.h1// Copyright (c) eBPF for Windows contributorsCOMMENT
LOWinclude/bpf/hashmap.h1// Copyright (c) eBPF for Windows contributorsCOMMENT
LOWtests/unit/wer_report_test_wrapper.cpp1// Copyright (c) eBPF for Windows contributorsCOMMENT
LOWtests/unit/libbpf_test_jit.cpp1// Copyright (c) eBPF for Windows contributorsCOMMENT
LOWtests/unit/libbpf_test_jit.cpp361#define BPF_ALU64_IMM(op, reg, imm) {INST_CLS_ALU64 | INST_SRC_IMM | ((op) << 4), (reg), 0, 0, (imm)}COMMENT
LOWtests/unit/libbpf_test.cpp1// Copyright (c) eBPF for Windows contributorsCOMMENT
LOWtests/unit/libbpf_test.cpp21COMMENT
LOWtests/unit/libbpf_test.cpp4601 return result;COMMENT
5225 more matches not shown…
Structural Annotation Overuse28 hits · 50 pts
SeverityFileLineSnippetContext
LOW.github/skills/verify-prevail/SKILL.md55### Step 1: Read the ReferenceCOMMENT
LOW.github/skills/verify-prevail/SKILL.md59### Step 2: Gather the ErrorCOMMENT
LOW.github/skills/verify-prevail/SKILL.md68### Step 3: Identify the Failure PatternCOMMENT
LOW.github/skills/verify-prevail/SKILL.md86### Step 4: Trace the Root CauseCOMMENT
LOW.github/skills/verify-prevail/SKILL.md94### Step 5: Recommend a FixCOMMENT
LOW.github/skills/pr-triage-report/SKILL.md93### Step 1: Scope the PR SetCOMMENT
LOW.github/skills/pr-triage-report/SKILL.md110### Step 2: Gather Per-PR MetadataCOMMENT
LOW.github/skills/pr-triage-report/SKILL.md151### Step 3: Compute AgeCOMMENT
LOW.github/skills/pr-triage-report/SKILL.md156### Step 4: Compute CI StatusCOMMENT
LOW.github/skills/pr-triage-report/SKILL.md200### Step 5: Determine Base-Branch FreshnessCOMMENT
LOW.github/skills/pr-triage-report/SKILL.md222### Step 6: Determine Current Sign-OffsCOMMENT
LOW.github/skills/pr-triage-report/SKILL.md243### Step 7: Determine Next StepCOMMENT
LOW.github/skills/pr-triage-report/SKILL.md259### Step 8: Compute FreshnessCOMMENT
LOW.github/skills/pr-triage-report/SKILL.md286### Step 9: Determine Next OwnerCOMMENT
LOW.github/skills/pr-triage-report/SKILL.md309### Step 10: Sort and Render the ReportCOMMENT
LOW.github/skills/verify-bpf/SKILL.md71### Step 1: Identify the SourceCOMMENT
LOW.github/skills/verify-bpf/SKILL.md81### Step 2: Compile with ClangCOMMENT
LOW.github/skills/verify-bpf/SKILL.md85### Step 3: Verify with bpf2cCOMMENT
LOW.github/skills/verify-bpf/SKILL.md92### Step 4: Diagnose FailuresCOMMENT
LOW.github/skills/build-ebpf/SKILL.md29### Step 1: Determine What to BuildCOMMENT
LOW.github/skills/build-ebpf/SKILL.md37### Step 2: Determine Configuration and PlatformCOMMENT
LOW.github/skills/build-ebpf/SKILL.md46### Step 3: Construct and Run the MSBuild CommandCOMMENT
LOW.github/skills/build-ebpf/SKILL.md84### Step 4: Analyze ResultsCOMMENT
LOW.github/skills/adversarial-branch-review/SKILL.md59### Step 1: Establish Review ScopeCOMMENT
LOW.github/skills/adversarial-branch-review/SKILL.md78### Step 2: Gather Branch ContextCOMMENT
LOW.github/skills/adversarial-branch-review/SKILL.md96### Step 3: Apply Adversarial Review MethodologyCOMMENT
LOW.github/skills/adversarial-branch-review/SKILL.md157### Step 4: Maintain Coverage ProofCOMMENT
LOW.github/skills/adversarial-branch-review/SKILL.md174### Step 5: Report Only High-Signal FindingsCOMMENT
Fake / Example Data25 hits · 37 pts
SeverityFileLineSnippetContext
LOWtests/sample/bindmonitor_tailcall.c122 uint32_t dummy_key = 0;CODE
LOWtests/sample/bindmonitor_tailcall.c123 uint32_t* dummy_value = bpf_map_lookup_elem(&dummy_map, &dummy_key);CODE
LOWtests/sample/bindmonitor_tailcall.c125 if (!dummy_value) {CODE
LOWtests/sample/bindmonitor_tailcall.c138 uint32_t dummy_key = 0;CODE
LOWtests/sample/bindmonitor_tailcall.c139 uint32_t* dummy_value = bpf_map_lookup_elem(&dummy_map, &dummy_key);CODE
LOWtests/sample/bindmonitor_tailcall.c141 if (!dummy_value) {CODE
LOWtests/sample/unsafe/invalid_helpers.c130 uint32_t dummy_key = 0;CODE
LOWtests/sample/unsafe/invalid_helpers.c131 uint32_t* dummy_value = bpf_map_lookup_elem(&dummy_map, &dummy_key);CODE
LOWtests/sample/unsafe/invalid_helpers.c133 if (!dummy_value) {CODE
LOWtests/sample/unsafe/invalid_helpers.c146 uint32_t dummy_key = 0;CODE
LOWtests/sample/unsafe/invalid_helpers.c147 uint32_t* dummy_value = bpf_map_lookup_elem(&dummy_map, &dummy_key);CODE
LOWtests/sample/unsafe/invalid_helpers.c149 if (!dummy_value) {CODE
LOWtests/sample/unsafe/invalid_maps2.c148 uint32_t dummy_key = 0;CODE
LOWtests/sample/unsafe/invalid_maps2.c149 uint32_t* dummy_value = bpf_map_lookup_elem(&dummy_map, &dummy_key);CODE
LOWtests/sample/unsafe/invalid_maps2.c151 if (!dummy_value) {CODE
LOWtests/sample/unsafe/invalid_maps2.c164 uint32_t dummy_key = 0;CODE
LOWtests/sample/unsafe/invalid_maps2.c165 uint32_t* dummy_value = bpf_map_lookup_elem(&dummy_map, &dummy_key);CODE
LOWtests/sample/unsafe/invalid_maps2.c167 if (!dummy_value) {CODE
LOWtests/sample/unsafe/invalid_maps1.c137 uint32_t dummy_key = 0;CODE
LOWtests/sample/unsafe/invalid_maps1.c138 uint32_t* dummy_value = bpf_map_lookup_elem(&dummy_map, &dummy_key);CODE
LOWtests/sample/unsafe/invalid_maps1.c140 if (!dummy_value) {CODE
LOWtests/sample/unsafe/invalid_maps1.c153 uint32_t dummy_key = 0;CODE
LOWtests/sample/unsafe/invalid_maps1.c154 uint32_t* dummy_value = bpf_map_lookup_elem(&dummy_map, &dummy_key);CODE
LOWtests/sample/unsafe/invalid_maps1.c156 if (!dummy_value) {CODE
LOWdocs/MultipleLoadNativeModule.md774. If runtime finds the module, and it is in "placeholder" state, it will block on an event, which will be set when theCODE
Hallucination Indicators3 hits · 30 pts
SeverityFileLineSnippetContext
CRITICAL.github/workflows/reusable-test.yml552 const opts = github.rest.issues.listForRepo.endpoint.merge({CODE
CRITICAL.github/workflows/check_wdk.yml66 const opts = github.rest.issues.listForRepo.endpoint.merge({CODE
CRITICAL.github/workflows/netperf.yml109 const opts = github.rest.issues.listForRepo.endpoint.merge({CODE
Decorative Section Separators4 hits · 12 pts
SeverityFileLineSnippetContext
MEDIUM.github/workflows/codeql.yml32 # ---------------------------------------------------------------------------COMMENT
MEDIUM.github/workflows/cicd.yml44 # ---------------------------------------------------------------------------COMMENT
MEDIUM.github/workflows/cicd.yml345 # ---------------------------------------------------------------------------COMMENT
MEDIUM.azure/OneBranch.PullRequest.yml170 # ---------------------------------------------------------------------------COMMENT
AI Slop Vocabulary3 hits · 9 pts
SeverityFileLineSnippetContext
MEDIUMtests/unit/libbpf_test.cpp454// This is a set of tests which utilize the libbpf XDP APIs.COMMENT
MEDIUMtests/stress/km/stress_tests_km.cpp384 // in a robust manner by ebpfcore.COMMENT
MEDIUMlibs/runtime/unit/platform_unit_test.cpp2432// Replace these test with a more robust test like TESTU01 or PractRand once licensing issues are resolved.COMMENT
Redundant / Tautological Comments1 hit · 2 pts
SeverityFileLineSnippetContext
LOW.github/workflows/reusable-test.yml126 # Check if .github/workflows/reusable-test.yml exists locally.COMMENT