eBPF implementation that runs on top of Windows
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).
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.
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.
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.
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.
| Severity | File | Line | Snippet | Context |
|---|---|---|---|---|
| LOW | tools/export_program_info/export_program_info.cpp | 1 | // Copyright (c) eBPF for Windows contributors | COMMENT |
| LOW | tools/export_program_info/resource.h | 1 | // Copyright (c) eBPF for Windows contributors | COMMENT |
| LOW | tools/bpf2c/bpf2c.cpp | 1 | // Copyright (c) eBPF for Windows contributors | COMMENT |
| LOW | tools/bpf2c/bpf_code_generator.cpp | 1 | // Copyright (c) eBPF for Windows contributors | COMMENT |
| LOW | tools/bpf2c/bpf_code_generator.cpp | 21 | #define ebpf_inst ebpf_inst_btf | COMMENT |
| LOW | tools/bpf2c/bpf_code_generator.cpp | 41 | // See: https://github.com/vbpf/prevail/issues/876 | COMMENT |
| LOW | tools/bpf2c/bpf_code_generator.cpp | 61 | #define EBPF_ATOMIC_ADD 0x00 | COMMENT |
| LOW | tools/bpf2c/bpf_code_generator.h | 1 | // Copyright (c) eBPF for Windows contributors | COMMENT |
| LOW | tools/bpf2c/resource.h | 1 | // Copyright (c) eBPF for Windows contributors | COMMENT |
| LOW | tools/netsh/resource.h | 1 | //{{NO_DEPENDENCIES}} | COMMENT |
| LOW | tools/netsh/resource.h | 21 | #define HLP_EBPF_SHOW_LINKS 117 | COMMENT |
| LOW | tools/netsh/resource.h | 41 | // Next default values for new objects. | COMMENT |
| LOW | tools/netsh/dllmain.c | 1 | // Copyright (c) eBPF for Windows contributors | COMMENT |
| LOW | tools/netsh/dllmain.c | 41 | #define CMD_GROUP_SHOW L"show" | COMMENT |
| LOW | tools/netsh/dllmain.c | 181 | #define HLP_GROUP_SET 1104 | COMMENT |
| LOW | tools/bpftool/resource.h | 1 | // Copyright (c) eBPF for Windows contributors | COMMENT |
| LOW | tools/port_leak/resource.h | 1 | // Copyright (c) eBPF for Windows contributors | COMMENT |
| LOW | tools/dnsflood/resource.h | 1 | // Copyright (c) eBPF for Windows contributors | COMMENT |
| LOW | tools/port_quota/resource.h | 1 | // Copyright (c) eBPF for Windows contributors | COMMENT |
| LOW | ebpfapi/rpc_client.cpp | 1 | // Copyright (c) eBPF for Windows contributors | COMMENT |
| LOW | ebpfapi/resource.h | 1 | // Copyright (c) eBPF for Windows contributors | COMMENT |
| LOW | include/bpf_endian.h | 41 | * to cpu_to_be16(). We could use it unconditionally in BPF | COMMENT |
| LOW | include/bpf_endian.h | 61 | #define __bpf_htons(x) (x) | COMMENT |
| LOW | include/bpf_endian.h | 81 | #define bpf_be64_to_cpu(x) (__builtin_constant_p(x) ? __bpf_constant_be64_to_cpu(x) : __bpf_be64_to_cpu(x)) | COMMENT |
| LOW | include/ebpf_windows.h | 1 | // Copyright (c) eBPF for Windows contributors | COMMENT |
| LOW | include/ebpf_windows.h | 21 | typedef unsigned short uint16_t; | COMMENT |
| LOW | include/ebpf_windows.h | 41 | #define EBPF_GLOBAL_HELPERS_REGISTRY_KEY L"GlobalHelpers" | COMMENT |
| LOW | include/ebpf_windows.h | 81 | #define EBPF_ATTACH_CLIENT_DATA_VERSION_TOTAL_SIZE sizeof(ebpf_extension_data_t) | COMMENT |
| LOW | include/ebpf_error.h | 1 | // Copyright (c) eBPF for Windows contributors | COMMENT |
| LOW | include/ebpf_program_types.h | 1 | // Copyright (c) eBPF for Windows contributors | COMMENT |
| LOW | include/bpf_helpers_platform.h | 1 | // Copyright (c) eBPF for Windows contributors | COMMENT |
| LOW | include/bpf2c.h | 21 | #else | COMMENT |
| LOW | include/bpf2c.h | 61 | COMMENT | |
| LOW | include/bpf_helpers.h | 1 | // Copyright (c) eBPF for Windows contributors | COMMENT |
| LOW | include/bpf_helpers.h | 41 | COMMENT | |
| LOW | include/bpf_helper_defs.h | 201 | EBPF_HELPER(long, bpf_trace_printk5, (const char* fmt, uint32_t fmt_size, uint64_t arg3, uint64_t arg4, uint64_t arg5)); | COMMENT |
| LOW | include/bpf_helper_defs.h | 481 | #define bpf_strnlen_s ((bpf_strnlen_s_t)BPF_FUNC_strnlen_s) | COMMENT |
| LOW | include/elfio_wrapper.hpp | 1 | // Copyright (c) eBPF for Windows contributors | COMMENT |
| LOW | include/ebpf_nethooks.h | 1 | // Copyright (c) eBPF for Windows contributors | COMMENT |
| LOW | include/ebpf_nethooks.h | 341 | #pragma warning(pop) | COMMENT |
| LOW | include/ebpf_api.h | 1 | // Copyright (c) eBPF for Windows contributors | COMMENT |
| LOW | include/uapi/linux/tcp.h | 1 | // Copyright (c) eBPF for Windows contributors | COMMENT |
| LOW | include/uapi/linux/bpf.h | 1 | // Copyright (c) eBPF for Windows contributors | COMMENT |
| LOW | include/uapi/linux/if_ether.h | 1 | // Copyright (c) eBPF for Windows contributors | COMMENT |
| LOW | include/uapi/linux/in.h | 1 | // Copyright (c) eBPF for Windows contributors | COMMENT |
| LOW | include/uapi/linux/ip.h | 1 | // Copyright (c) eBPF for Windows contributors | COMMENT |
| LOW | include/asm/posix_types.h | 1 | // Copyright (c) eBPF for Windows contributors | COMMENT |
| LOW | include/asm/errno.h | 1 | // Copyright (c) eBPF for Windows contributors | COMMENT |
| LOW | include/net/if_ether.h | 21 | uint16_t Length; // IEEE 802 | COMMENT |
| LOW | include/net/ip.h | 1 | // Copyright (c) eBPF for Windows contributors | COMMENT |
| LOW | include/bpf_conformance/bpf_conformance.h | 1 | // Copyright (c) eBPF for Windows contributors | COMMENT |
| LOW | include/linux/bpf.h | 1 | // Copyright (c) eBPF for Windows contributors | COMMENT |
| LOW | include/linux/stddef.h | 1 | // Copyright (c) eBPF for Windows contributors | COMMENT |
| LOW | include/bpf/hashmap.h | 1 | // Copyright (c) eBPF for Windows contributors | COMMENT |
| LOW | tests/unit/wer_report_test_wrapper.cpp | 1 | // Copyright (c) eBPF for Windows contributors | COMMENT |
| LOW | tests/unit/libbpf_test_jit.cpp | 1 | // Copyright (c) eBPF for Windows contributors | COMMENT |
| LOW | tests/unit/libbpf_test_jit.cpp | 361 | #define BPF_ALU64_IMM(op, reg, imm) {INST_CLS_ALU64 | INST_SRC_IMM | ((op) << 4), (reg), 0, 0, (imm)} | COMMENT |
| LOW | tests/unit/libbpf_test.cpp | 1 | // Copyright (c) eBPF for Windows contributors | COMMENT |
| LOW | tests/unit/libbpf_test.cpp | 21 | COMMENT | |
| LOW | tests/unit/libbpf_test.cpp | 4601 | return result; | COMMENT |
| 5225 more matches not shown… | ||||
| Severity | File | Line | Snippet | Context |
|---|---|---|---|---|
| LOW⚡ | .github/skills/verify-prevail/SKILL.md | 55 | ### Step 1: Read the Reference | COMMENT |
| LOW⚡ | .github/skills/verify-prevail/SKILL.md | 59 | ### Step 2: Gather the Error | COMMENT |
| LOW⚡ | .github/skills/verify-prevail/SKILL.md | 68 | ### Step 3: Identify the Failure Pattern | COMMENT |
| LOW | .github/skills/verify-prevail/SKILL.md | 86 | ### Step 4: Trace the Root Cause | COMMENT |
| LOW | .github/skills/verify-prevail/SKILL.md | 94 | ### Step 5: Recommend a Fix | COMMENT |
| LOW | .github/skills/pr-triage-report/SKILL.md | 93 | ### Step 1: Scope the PR Set | COMMENT |
| LOW | .github/skills/pr-triage-report/SKILL.md | 110 | ### Step 2: Gather Per-PR Metadata | COMMENT |
| LOW | .github/skills/pr-triage-report/SKILL.md | 151 | ### Step 3: Compute Age | COMMENT |
| LOW | .github/skills/pr-triage-report/SKILL.md | 156 | ### Step 4: Compute CI Status | COMMENT |
| LOW | .github/skills/pr-triage-report/SKILL.md | 200 | ### Step 5: Determine Base-Branch Freshness | COMMENT |
| LOW | .github/skills/pr-triage-report/SKILL.md | 222 | ### Step 6: Determine Current Sign-Offs | COMMENT |
| LOW | .github/skills/pr-triage-report/SKILL.md | 243 | ### Step 7: Determine Next Step | COMMENT |
| LOW | .github/skills/pr-triage-report/SKILL.md | 259 | ### Step 8: Compute Freshness | COMMENT |
| LOW | .github/skills/pr-triage-report/SKILL.md | 286 | ### Step 9: Determine Next Owner | COMMENT |
| LOW | .github/skills/pr-triage-report/SKILL.md | 309 | ### Step 10: Sort and Render the Report | COMMENT |
| LOW⚡ | .github/skills/verify-bpf/SKILL.md | 71 | ### Step 1: Identify the Source | COMMENT |
| LOW⚡ | .github/skills/verify-bpf/SKILL.md | 81 | ### Step 2: Compile with Clang | COMMENT |
| LOW⚡ | .github/skills/verify-bpf/SKILL.md | 85 | ### Step 3: Verify with bpf2c | COMMENT |
| LOW⚡ | .github/skills/verify-bpf/SKILL.md | 92 | ### Step 4: Diagnose Failures | COMMENT |
| LOW⚡ | .github/skills/build-ebpf/SKILL.md | 29 | ### Step 1: Determine What to Build | COMMENT |
| LOW⚡ | .github/skills/build-ebpf/SKILL.md | 37 | ### Step 2: Determine Configuration and Platform | COMMENT |
| LOW⚡ | .github/skills/build-ebpf/SKILL.md | 46 | ### Step 3: Construct and Run the MSBuild Command | COMMENT |
| LOW | .github/skills/build-ebpf/SKILL.md | 84 | ### Step 4: Analyze Results | COMMENT |
| LOW | .github/skills/adversarial-branch-review/SKILL.md | 59 | ### Step 1: Establish Review Scope | COMMENT |
| LOW | .github/skills/adversarial-branch-review/SKILL.md | 78 | ### Step 2: Gather Branch Context | COMMENT |
| LOW | .github/skills/adversarial-branch-review/SKILL.md | 96 | ### Step 3: Apply Adversarial Review Methodology | COMMENT |
| LOW | .github/skills/adversarial-branch-review/SKILL.md | 157 | ### Step 4: Maintain Coverage Proof | COMMENT |
| LOW | .github/skills/adversarial-branch-review/SKILL.md | 174 | ### Step 5: Report Only High-Signal Findings | COMMENT |
| Severity | File | Line | Snippet | Context |
|---|---|---|---|---|
| LOW⚡ | tests/sample/bindmonitor_tailcall.c | 122 | uint32_t dummy_key = 0; | CODE |
| LOW⚡ | tests/sample/bindmonitor_tailcall.c | 123 | uint32_t* dummy_value = bpf_map_lookup_elem(&dummy_map, &dummy_key); | CODE |
| LOW⚡ | tests/sample/bindmonitor_tailcall.c | 125 | if (!dummy_value) { | CODE |
| LOW⚡ | tests/sample/bindmonitor_tailcall.c | 138 | uint32_t dummy_key = 0; | CODE |
| LOW⚡ | tests/sample/bindmonitor_tailcall.c | 139 | uint32_t* dummy_value = bpf_map_lookup_elem(&dummy_map, &dummy_key); | CODE |
| LOW⚡ | tests/sample/bindmonitor_tailcall.c | 141 | if (!dummy_value) { | CODE |
| LOW⚡ | tests/sample/unsafe/invalid_helpers.c | 130 | uint32_t dummy_key = 0; | CODE |
| LOW⚡ | tests/sample/unsafe/invalid_helpers.c | 131 | uint32_t* dummy_value = bpf_map_lookup_elem(&dummy_map, &dummy_key); | CODE |
| LOW⚡ | tests/sample/unsafe/invalid_helpers.c | 133 | if (!dummy_value) { | CODE |
| LOW⚡ | tests/sample/unsafe/invalid_helpers.c | 146 | uint32_t dummy_key = 0; | CODE |
| LOW⚡ | tests/sample/unsafe/invalid_helpers.c | 147 | uint32_t* dummy_value = bpf_map_lookup_elem(&dummy_map, &dummy_key); | CODE |
| LOW⚡ | tests/sample/unsafe/invalid_helpers.c | 149 | if (!dummy_value) { | CODE |
| LOW⚡ | tests/sample/unsafe/invalid_maps2.c | 148 | uint32_t dummy_key = 0; | CODE |
| LOW⚡ | tests/sample/unsafe/invalid_maps2.c | 149 | uint32_t* dummy_value = bpf_map_lookup_elem(&dummy_map, &dummy_key); | CODE |
| LOW⚡ | tests/sample/unsafe/invalid_maps2.c | 151 | if (!dummy_value) { | CODE |
| LOW⚡ | tests/sample/unsafe/invalid_maps2.c | 164 | uint32_t dummy_key = 0; | CODE |
| LOW⚡ | tests/sample/unsafe/invalid_maps2.c | 165 | uint32_t* dummy_value = bpf_map_lookup_elem(&dummy_map, &dummy_key); | CODE |
| LOW⚡ | tests/sample/unsafe/invalid_maps2.c | 167 | if (!dummy_value) { | CODE |
| LOW⚡ | tests/sample/unsafe/invalid_maps1.c | 137 | uint32_t dummy_key = 0; | CODE |
| LOW⚡ | tests/sample/unsafe/invalid_maps1.c | 138 | uint32_t* dummy_value = bpf_map_lookup_elem(&dummy_map, &dummy_key); | CODE |
| LOW⚡ | tests/sample/unsafe/invalid_maps1.c | 140 | if (!dummy_value) { | CODE |
| LOW⚡ | tests/sample/unsafe/invalid_maps1.c | 153 | uint32_t dummy_key = 0; | CODE |
| LOW⚡ | tests/sample/unsafe/invalid_maps1.c | 154 | uint32_t* dummy_value = bpf_map_lookup_elem(&dummy_map, &dummy_key); | CODE |
| LOW⚡ | tests/sample/unsafe/invalid_maps1.c | 156 | if (!dummy_value) { | CODE |
| LOW | docs/MultipleLoadNativeModule.md | 77 | 4. If runtime finds the module, and it is in "placeholder" state, it will block on an event, which will be set when the | CODE |
| Severity | File | Line | Snippet | Context |
|---|---|---|---|---|
| CRITICAL | .github/workflows/reusable-test.yml | 552 | const opts = github.rest.issues.listForRepo.endpoint.merge({ | CODE |
| CRITICAL | .github/workflows/check_wdk.yml | 66 | const opts = github.rest.issues.listForRepo.endpoint.merge({ | CODE |
| CRITICAL | .github/workflows/netperf.yml | 109 | const opts = github.rest.issues.listForRepo.endpoint.merge({ | CODE |
| Severity | File | Line | Snippet | Context |
|---|---|---|---|---|
| MEDIUM | .github/workflows/codeql.yml | 32 | # --------------------------------------------------------------------------- | COMMENT |
| MEDIUM | .github/workflows/cicd.yml | 44 | # --------------------------------------------------------------------------- | COMMENT |
| MEDIUM | .github/workflows/cicd.yml | 345 | # --------------------------------------------------------------------------- | COMMENT |
| MEDIUM | .azure/OneBranch.PullRequest.yml | 170 | # --------------------------------------------------------------------------- | COMMENT |
| Severity | File | Line | Snippet | Context |
|---|---|---|---|---|
| MEDIUM | tests/unit/libbpf_test.cpp | 454 | // This is a set of tests which utilize the libbpf XDP APIs. | COMMENT |
| MEDIUM | tests/stress/km/stress_tests_km.cpp | 384 | // in a robust manner by ebpfcore. | COMMENT |
| MEDIUM | libs/runtime/unit/platform_unit_test.cpp | 2432 | // Replace these test with a more robust test like TESTU01 or PractRand once licensing issues are resolved. | COMMENT |
| Severity | File | Line | Snippet | Context |
|---|---|---|---|---|
| LOW | .github/workflows/reusable-test.yml | 126 | # Check if .github/workflows/reusable-test.yml exists locally. | COMMENT |