'use strict'; const REPLACE_STRINGS = ['HackTheBox - ', 'VulnHub - ', 'UHC - ']; const PAGE_SIZE = 50; const POC_PREVIEW = 5; const ADVISORY_PREVIEW = 3; const TREND_ROWS = 20; const MIN_QUERY = 2; const POC_FIELDS = ['poc', 'nuclei', 'msf', 'edb', 'vulhub', 'collections']; const FILTER_OPTIONS = { severity: [ ['CRITICAL', 'CRITICAL'], ['HIGH', 'HIGH'], ['MEDIUM', 'MEDIUM'], ['LOW', 'LOW'] ], source: [ ['GITHUB', 'GITHUB'], ['GHSA', 'GHSA'], ['REFERENCE', 'REFERENCE'], ['NUCLEI', 'NUCLEI'], ['MSF', 'METASPLOIT'], ['EDB', 'EXPLOITDB'], ['VULHUB', 'VULHUB'], ['COLLECTIONS', 'COLLECTIONS'] ] }; const state = { query: '', mode: 'LANDED', sort: 'RELEVANCE', shown: PAGE_SIZE, descOpen: new Set(), pocOpen: new Set(), advisoryOpen: new Set(), kevOnly: false, filters: { severity: new Set(FILTER_OPTIONS.severity.map(([value]) => value)), source: new Set(FILTER_OPTIONS.source.map(([value]) => value)) }, ready: false, loadFailed: false, results: [] }; let dataset = []; let repoMeta = {}; let kev = {}; let ratings = {}; let metadata = {}; let epss = {}; let indexMeta = null; /* ---- formatting -------------------------------------------------------- */ function escapeHTML(value) { return String(value == null ? '' : value).replace(/[&<>"']/g, ch => ({ '&': '&', '<': '<', '>': '>', '"': '"', "'": ''' }[ch])); } function formatCount(n) { return n.toLocaleString('en-US'); } /** 1st, 2nd, 3rd, 4th. A hard-coded "th" printed 51th on 21,100 CVEs. */ function ordinal(n) { const tens = n % 100; if (tens >= 11 && tens <= 13) return `${n}th`; return `${n}${['th', 'st', 'nd', 'rd'][n % 10] || 'th'}`; } function formatStars(n) { return n >= 1000 ? (n / 1000).toFixed(1) + 'k' : String(n); } function hoursSince(iso) { if (!iso) return null; const then = Date.parse(iso.length === 10 ? iso + 'T00:00:00Z' : iso); if (Number.isNaN(then)) return null; return Math.max(0, (Date.now() - then) / 36e5); } /** UTC date of an ISO date or timestamp, read as build_pages.py reads it: a * time without a zone is UTC. Empty when there is no readable date. */ function utcDay(value) { if (typeof value !== 'string' || !/^\d{4}-\d{2}-\d{2}/.test(value)) return ''; const time = Date.parse(/T[\d:.]+$/.test(value) ? value + 'Z' : value); return Number.isNaN(time) ? '' : new Date(time).toISOString().slice(0, 10); } /** Compact age for the PoC columns: 3h, 3d, 2w, 5mo, 2y. */ function shortAge(hours) { if (hours == null) return ''; if (hours < 24) return Math.max(1, Math.round(hours)) + 'h'; const days = hours / 24; if (days < 14) return Math.round(days) + 'd'; if (days < 60) return Math.round(days / 7) + 'w'; if (days < 730) return Math.round(days / 30) + 'mo'; return Math.round(days / 365) + 'y'; } // github.com serves more than repositories; an attachment or an advisory has // no owner and no stars, and reads as nonsense in an owner / repo row. const NOT_A_REPO = new Set(['user-attachments', 'advisories', 'security', 'orgs', 'apps', 'marketplace', 'sponsors', 'topics', 'collections', 'settings', 'notifications']); function repoFromUrl(url) { const match = /^https?:\/\/(?:www\.)?github\.com\/([^/#?]+)\/([^/#?]+)/i.exec(url || ''); if (!match || NOT_A_REPO.has(match[1].toLowerCase()) || /^\/security\/advisories(?:\/|$)/i.test(url.slice(match[0].length))) return null; return { owner: match[1], repo: match[2].replace(/\.git$/i, '') }; } /** Everything after the host, for links that are not GitHub repositories. */ function plainLinkLabel(url) { try { const parsed = new URL(url); return parsed.host.replace(/^www\./, '') + parsed.pathname.replace(/\/$/, ''); } catch (err) { return url; } } /* ---- matching ---------------------------------------------------------- */ function normalizeToSpaces(value) { return value.toLowerCase().replace(/[^a-z0-9]+/g, ' ').trim(); } function buildLooseRegex(value) { const compact = value.toLowerCase().replace(/[^a-z0-9]+/g, ''); if (compact.length < 4) return null; const escaped = compact.replace(/[.*+?^${}()|[\]\\]/g, '\\$&'); return new RegExp(escaped.split('').join('[^a-z0-9]*')); } function buildMatcher(term) { const raw = term.toLowerCase().trim(); if (!raw) return null; const isPhrase = /\s/.test(raw); const normalized = raw.replace(/[^a-z0-9]+/g, ''); return { raw, isPhrase, phrase: isPhrase ? normalizeToSpaces(raw) : '', loose: !isPhrase && normalized.length >= 4 ? buildLooseRegex(raw) : null }; } // Plain substring matching made "rce" hit "open source" and "sudo" hit // "pseudo". Require the term to start a word; matching into the end of one is // still allowed so that "word" finds "wordpress". function wordStart(text, term) { let at = text.indexOf(term); while (at > 0) { const code = text.charCodeAt(at - 1); if (!((code > 96 && code < 123) || (code > 47 && code < 58))) return at; at = text.indexOf(term, at + 1); } return at; } // A term in the opening of an advisory is what it is about; one buried deep in // the prose is usually incidental. Coarse buckets so that a few characters of // difference never outweighs the newest-first tie-break. function leadBonus(index) { if (index < 0) return 0; if (index < 80) return 80; if (index < 300) return 40; return 0; } function pocText(entry) { if (entry._pocText === undefined) { entry._pocText = entryLinks(entry).join(' ').toLowerCase(); } return entry._pocText; } function entryLinks(entry) { if (entry._allLinks === undefined) { entry._allLinks = uniqueSourceLinks( POC_FIELDS.flatMap(field => entry[field] || []), POC_FIELDS.slice(1).flatMap(field => entry[field] || [])); } return entry._allLinks; } function pocSpace(entry) { if (entry._pocSpace === undefined) { entry._pocSpace = normalizeToSpaces(pocText(entry)); } return entry._pocSpace; } function descSpace(entry) { if (entry._descSpace === undefined) { entry._descSpace = normalizeToSpaces(entry._descText); } return entry._descSpace; } function scoreEntry(entry, matcher) { if (!matcher || !matcher.raw) return 0; if (matcher.isPhrase) { const phrase = matcher.phrase; if (!phrase) return 0; if (entry._titleSpace && wordStart(entry._titleSpace, phrase) >= 0) return 300; const at = wordStart(descSpace(entry), phrase); if (at >= 0) return 200 + leadBonus(at); if (wordStart(pocSpace(entry), phrase) >= 0) return 80; return 0; } const raw = matcher.raw; if (entry._cveText.includes(raw)) return 600; // The record's own title, vendor and product name what it is about; a hit // there outranks any position in the prose. if (entry._titleText && wordStart(entry._titleText, raw) >= 0) return 400; const at = wordStart(entry._descText, raw); if (at >= 0) return 240 + leadBonus(at); if (wordStart(pocText(entry), raw) >= 0) return 80; if (matcher.loose) { if (matcher.loose.test(entry._descText)) return 160; if (matcher.loose.test(pocText(entry))) return 60; } return 0; } /** How many of an entry's links carry every search term. */ function countLinkHits(entry, matchers) { let hits = 0; for (const url of entryLinks(entry)) { const text = url.toLowerCase(); if (matchers.every(m => wordStart(text, m.raw) >= 0 || (m.loose && m.loose.test(text)))) { hits += 1; if (hits >= 999) break; } } return hits; } function canonicalCvss(id) { const rows = ((metadata[id] || {}).cvss || []); if (!Array.isArray(rows) || !Array.isArray(rows[0])) return null; const row = rows[0]; return { score: Number(row[1]), severity: String(row[2] || '').toUpperCase() }; } // Cached per entry. A filter pass asked the metadata for every one of 82,000 // entries on every keystroke; the answer only changes when a data file lands, // which bumps the epoch. let severityEpoch = 0; function entrySeverity(entry) { if (entry._sevEpoch === severityEpoch) return entry._sev; const score = canonicalCvss(entry.cve); let severity = ''; if (score && ['NONE', 'LOW', 'MEDIUM', 'HIGH', 'CRITICAL'].includes(score.severity)) { severity = score.severity; } else { const fallback = String((ratings[entry.cve] || {}).severity || '').toUpperCase(); severity = ['NONE', 'LOW', 'MEDIUM', 'HIGH', 'CRITICAL'].includes(fallback) ? fallback : ''; } entry._sev = severity; entry._sevEpoch = severityEpoch; return severity; } function hasActiveFilters() { return state.kevOnly || Object.entries(state.filters).some( ([kind, filter]) => filter.size !== FILTER_OPTIONS[kind].length ); } function entrySources(entry) { if (entry._sources) return entry._sources; const sources = new Set(); const fields = { NUCLEI: 'nuclei', MSF: 'msf', EDB: 'edb', VULHUB: 'vulhub', COLLECTIONS: 'collections' }; for (const [source, field] of Object.entries(fields)) { if ((entry[field] || []).length) sources.add(source); } for (const url of entry.poc || []) { if (/^https?:\/\/(?:www\.)?github\.com\/(?:advisories|[^/]+\/[^/]+\/security\/advisories)\/GHSA-/i.test(url)) { sources.add('GHSA'); } else if (repoFromUrl(url)) { sources.add('GITHUB'); } else { sources.add('REFERENCE'); } } entry._sources = sources; return sources; } function matchesMultiFilter(values, filter) { for (const value of filter) { if (values.has(value)) return true; } return false; } function matchesFilters(entry) { if (state.kevOnly && !kev[entry.cve]) return false; if (!matchesMultiFilter(entrySources(entry), state.filters.source)) return false; // ALL has to mean all. The options list only names the four scored bands, so // testing membership hid every CVE nobody has scored yet even with nothing // filtered: 41 of them were unreachable by search, including by exact ID. if (state.filters.severity.size === FILTER_OPTIONS.severity.length) return true; const severity = entrySeverity(entry); return severity ? matchesMultiFilter(new Set([severity]), state.filters.severity) : false; } /* ---- word index -------------------------------------------------------- */ // Every keystroke used to scan 28 MB of description text, and for terms of // four characters or more the loose regex then ran against every entry that // did not match, about 80,000 regex tests a keystroke. The index maps each // word to the entries carrying it, so a term is a prefix lookup in a sorted // word list and the scan only touches the candidates. It is built in slices // after the index loads so typing never waits on it; until then the scan does // the work exactly as before. const wordIndex = { words: null, postings: new Map(), ready: false, built: 0 }; function tokensOf(text) { return text ? text.match(/[a-z0-9]+/g) || [] : []; } function indexSlice(budget) { const started = performance.now(); const postings = wordIndex.postings; while (wordIndex.built < dataset.length) { const at = wordIndex.built; const entry = dataset[at]; const words = (entry._descText + ' ' + entry._titleText + ' ' + pocSpace(entry)).match(/[a-z0-9]+/g); if (words) { // Entries arrive in order, so a repeat within one entry is always the // last id on the list and needs no set to catch it. for (const word of words) { const list = postings.get(word); if (!list) postings.set(word, [at]); else if (list[list.length - 1] !== at) list.push(at); } } wordIndex.built += 1; if ((at & 127) === 0 && performance.now() - started > budget) break; } if (wordIndex.built < dataset.length) { yieldThen(() => indexSlice(budget)); return; } wordIndex.words = [...postings.keys()].sort(); wordIndex.ready = true; wordIndex.elapsed = Math.round(performance.now() - wordIndex.startedAt); if (state.ready && state.query.length >= MIN_QUERY && !state.results.length) render(); } // Hands the thread back between slices. A timer would do, except that a // background tab clamps timers to once a second and the build took a minute // there; a message port yields to the event loop without that throttle. const yieldPort = new MessageChannel(); let yieldNext = null; yieldPort.port1.onmessage = () => { const next = yieldNext; yieldNext = null; if (next) next(); }; function yieldThen(fn) { yieldNext = fn; yieldPort.port2.postMessage(null); } function buildWordIndex() { wordIndex.postings = new Map(); wordIndex.words = null; wordIndex.built = 0; wordIndex.ready = false; wordIndex.startedAt = performance.now(); indexSlice(32); } // The slice of the sorted word list that starts with the prefix. function wordRange(prefix) { const words = wordIndex.words; if (!words) return [0, 0]; let low = 0; let high = words.length; while (low < high) { const mid = (low + high) >> 1; if (words[mid] < prefix) low = mid + 1; else high = mid; } const start = low; high = words.length; while (low < high) { const mid = (low + high) >> 1; if (words[mid].startsWith(prefix)) low = mid + 1; else high = mid; } return [start, low]; } // How many of the terms each entry can satisfy, by word. A term has to start a // word, and may run on into the end of one, so its last part is a prefix and // any earlier parts are whole words: "pan-os" is the word "pan" followed by a // word starting "os". The scoring pass still checks the literal text; this // only decides which entries are worth its time. function candidateCounts(groups) { const size = dataset.length; const total = new Uint8Array(size); const stampOf = new Int32Array(size); const hit = new Uint8Array(size); let stamp = 0; for (const group of groups) { hit.fill(0); for (const matcher of group) { const parts = tokensOf(matcher.isPhrase ? matcher.phrase : matcher.raw); if (!parts.length) return null; const partCount = new Uint8Array(size); parts.forEach((part, index) => { stamp += 1; const bump = at => { if (stampOf[at] !== stamp) { stampOf[at] = stamp; partCount[at] += 1; } }; if (index === parts.length - 1) { const [start, end] = wordRange(part); for (let i = start; i < end; i++) { for (const at of wordIndex.postings.get(wordIndex.words[i])) bump(at); } } else { for (const at of wordIndex.postings.get(part) || []) bump(at); } }); // A CVE id is not a word in anybody's description, so it is checked apart. const raw = matcher.raw; for (let at = 0; at < size; at++) { if (partCount[at] === parts.length || dataset[at]._cveText.includes(raw)) hit[at] = 1; } } for (let at = 0; at < size; at++) if (hit[at]) total[at] += 1; } return total; } function scoreGroup(entry, group) { let best = 0; for (const matcher of group) { const score = scoreEntry(entry, matcher); if (score > best) best = score; } return best; } /* ---- what people type versus what the records say ----------------------- */ // Security slang against NVD prose. "sqli" found 843 CVEs and "sql injection" // 12,719; a term expands to its phrases and an entry matches on any of them. const ALIASES = { sqli: ['sql injection'], xss: ['cross-site scripting', 'cross site scripting'], rce: ['remote code execution'], lpe: ['privilege escalation'], privesc: ['privilege escalation'], eop: ['elevation of privilege', 'privilege escalation'], lfi: ['local file inclusion'], rfi: ['remote file inclusion'], xxe: ['xml external entity'], csrf: ['cross-site request forgery'], ssrf: ['server-side request forgery'], ssti: ['server-side template injection'], idor: ['insecure direct object reference'], dos: ['denial of service'], cmdi: ['command injection'], traversal: ['path traversal', 'directory traversal'], deserialization: ['deserialization of untrusted data', 'insecure deserialization'], bypass: ['authentication bypass', 'authorization bypass'], overflow: ['buffer overflow', 'heap overflow', 'stack overflow', 'integer overflow'] }; // The names a vulnerability is known by, when the query is exactly that name. // The record it belongs to leads whatever the prose and repositories say. const NAMED = { log4shell: 'CVE-2021-44228', heartbleed: 'CVE-2014-0160', eternalblue: 'CVE-2017-0144', eternalromance: 'CVE-2017-0145', wannacry: 'CVE-2017-0144', printnightmare: 'CVE-2021-34527', zerologon: 'CVE-2020-1472', spring4shell: 'CVE-2022-22965', proxyshell: 'CVE-2021-34473', proxylogon: 'CVE-2021-26855', proxynotshell: 'CVE-2022-41040', citrixbleed: 'CVE-2023-4966', citrixbleed2: 'CVE-2025-5777', regresshion: 'CVE-2024-6387', bluekeep: 'CVE-2019-0708', shellshock: 'CVE-2014-6271', dirtypipe: 'CVE-2022-0847', dirtycow: 'CVE-2016-5195', follina: 'CVE-2022-30190', ghostcat: 'CVE-2020-1938', looneytunables: 'CVE-2023-4911', text4shell: 'CVE-2022-42889', pwnkit: 'CVE-2021-4034', baronsamedit: 'CVE-2021-3156', moveit: 'CVE-2023-34362', smbghost: 'CVE-2020-0796', petitpotam: 'CVE-2021-36942', hivenightmare: 'CVE-2021-36934', serioussam: 'CVE-2021-36934', sambacry: 'CVE-2017-7494', drupalgeddon: 'CVE-2014-3704', drupalgeddon2: 'CVE-2018-7600', curveball: 'CVE-2020-0601', sigred: 'CVE-2020-1350', poodle: 'CVE-2014-3566', meltdown: 'CVE-2017-5754', spectre: 'CVE-2017-5753', krack: 'CVE-2017-13077', zenbleed: 'CVE-2023-20593', downfall: 'CVE-2022-40982', terrapin: 'CVE-2023-48795', xzbackdoor: 'CVE-2024-3094' }; function namedCve(query) { return NAMED[query.toLowerCase().replace(/[^a-z0-9]+/g, '')] || null; } // A typo has no word in the index at all, which a real term nearly never has. // The closest word one edit away, weighed by how many records use it, stands // in and the status line says so. function withinOneEdit(a, b) { if (a === b) return true; if (Math.abs(a.length - b.length) > 1) return false; let i = 0; while (i < a.length && i < b.length && a[i] === b[i]) i++; if (a.length === b.length) { if (a.slice(i + 1) === b.slice(i + 1)) return true; return i + 1 < a.length && a[i] === b[i + 1] && a[i + 1] === b[i] && a.slice(i + 2) === b.slice(i + 2); } return a.length > b.length ? a.slice(i + 1) === b.slice(i) : b.slice(i + 1) === a.slice(i); } function closestWord(term) { const [start, end] = wordRange(term[0]); let best = null; let bestSize = 0; for (let i = start; i < end; i++) { const word = wordIndex.words[i]; if (Math.abs(word.length - term.length) > 1 || !withinOneEdit(term, word)) continue; const size = wordIndex.postings.get(word).length; if (size > bestSize) { best = word; bestSize = size; } } return best; } function correctTerms(terms) { const changes = []; const fixed = terms.map(term => { const bare = term.replace(/^-?"|"$/g, '').toLowerCase(); if (term[0] === '-' || term[0] === '"' || !/^[a-z0-9]{4,}$/.test(bare) || ALIASES[bare]) return term; const [start, end] = wordRange(bare); if (end > start) return term; const alt = closestWord(bare); if (!alt) return term; changes.push([bare, alt]); return alt; }); return changes.length ? { query: fixed.join(' '), changes } : null; } /* ---- search ------------------------------------------------------------ */ const SORTS = [['RELEVANCE', 'RELEVANCE'], ['NEWEST', 'NEWEST'], ['POCS', 'MOST POCS']]; // Coarse steps so that one extra repository never decides the order on its own. function linkBucket(count) { return count >= 100 ? 4 : count >= 20 ? 3 : count >= 5 ? 2 : count >= 2 ? 1 : 0; } // Within a score tier the evidence decides, newest last: whether CISA lists // it, how many PoCs exist, how likely exploitation is. Falling straight // through to the year put five 2026 records above regreSSHion for "openssh" // and hid Log4Shell from the first page of "log4j". function compareRelevance(a, b) { if (b._score !== a._score) return b._score - a._score; if (b._hits !== a._hits) return b._hits - a._hits; const ka = kev[a.cve] ? 1 : 0; const kb = kev[b.cve] ? 1 : 0; if (kb !== ka) return kb - ka; const la = linkBucket(entryLinks(a).length); const lb = linkBucket(entryLinks(b).length); if (lb !== la) return lb - la; const ea = Math.round(((epss[a.cve] || [0])[0] || 0) * 100); const eb = Math.round(((epss[b.cve] || [0])[0] || 0) * 100); if (eb !== ea) return eb - ea; if (b._year !== a._year) return b._year - a._year; return b._num - a._num; } function compareNewest(a, b) { return (b._year - a._year) || (b._num - a._num) || (b._score - a._score); } function comparePocs(a, b) { return (entryLinks(b).length - entryLinks(a).length) || (b._score - a._score) || (b._year - a._year) || (b._num - a._num); } function runSearch(query, scan = false, corrected = false) { const terms = query.match(/-?"[^"]+"|-?\S+/g) || []; const cleaned = terms.map(t => t.replace(/^(-?)"/, '$1').replace(/"$/, '')); const positive = cleaned.filter(t => t && t[0] !== '-'); const matchers = positive.map(buildMatcher).filter(Boolean); const groups = matchers.map(m => [m, ...(ALIASES[m.raw] || []).map(buildMatcher).filter(Boolean)]); // Unquoted words are matched independently, so "active directory" also hits a // description holding "active session" and "working directory". Reward the // words appearing together to keep those below real matches. const adjacent = positive.length > 1 ? positive.join(' ').toLowerCase() : ''; const negatives = cleaned .filter(t => t && t[0] === '-') .map(t => t.slice(1)) .filter(Boolean) .map(buildMatcher) .filter(Boolean); const counts = !scan && wordIndex.ready && groups.length ? candidateCounts(groups) : null; const results = []; results.pocTotal = 0; for (let at = 0; at < dataset.length; at++) { if (counts && counts[at] !== groups.length) continue; const entry = dataset[at]; if (!matchesFilters(entry)) continue; let score = 0; let matched = true; let describes = false; for (const group of groups) { const termScore = scoreGroup(entry, group); if (termScore === 0) { matched = false; break; } if (termScore >= 160) describes = true; score += termScore; } if (!matched) continue; if (negatives.some(m => scoreEntry(entry, m) > 0)) continue; if (adjacent) { const at = wordStart(entry._descText, adjacent); if (at >= 0) { score += 300 + leadBonus(at); describes = true; } else if (wordStart(pocText(entry), adjacent) >= 0) score += 100; } entry._score = score; // A term nobody's advisory text uses, "log4shell" for one, leaves every match tied // at the weakest tier, where newest-first is meaningless. How many of the // linked PoCs carry the term says far more than which CVE is newer. entry._hits = describes ? 0 : countLinkHits(entry, matchers); results.pocTotal += entryLinks(entry).length; results.push(entry); } // The index finds a term where it starts a word. Its loose form, "log-4j" // for log4j, can only be found by the full pass, which is worth paying for // when the indexed pass came back nearly empty and not otherwise. let out = results; if (counts && results.length < 5 && matchers.some(m => m.loose)) out = runSearch(query, true, corrected); if (!out.length && !scan && !corrected && wordIndex.ready) { const fix = correctTerms(terms); if (fix) { const again = runSearch(fix.query, false, true); again.corrected = fix.changes; return again; } } const star = scan || corrected ? null : namedCve(query); if (star) { let entry = out.find(e => e.cve === star); if (!entry) { entry = dataset.find(e => e.cve === star); if (entry && matchesFilters(entry)) { entry._score = 0; entry._hits = 0; out.pocTotal += entryLinks(entry).length; out.push(entry); } } if (entry) entry._score += 100000; } out.sort(state.sort === 'NEWEST' ? compareNewest : state.sort === 'POCS' ? comparePocs : compareRelevance); return out; } function prepareDataset(raw) { if (!Array.isArray(raw)) return []; const out = []; for (const entry of raw) { const cve = (entry.cve || '').trim(); if (!cve) continue; for (const field of POC_FIELDS) { if (!Array.isArray(entry[field])) entry[field] = []; } if (!entryLinks(entry).length) continue; const parts = cve.split('-'); entry._cveText = cve.toLowerCase(); entry._descText = REPLACE_STRINGS .reduce((desc, str) => desc.replace(str, ''), entry.desc || '') .toLowerCase(); entry._year = parseInt(parts[1], 10) || 0; entry._num = parseInt(parts[2], 10) || 0; // Title, vendor and product, once the records carry them. const named = [entry.title || '', ...(entry.vendor || []), ...(entry.product || [])].join(' '); entry._titleText = named.toLowerCase(); entry._titleSpace = normalizeToSpaces(entry._titleText); out.push(entry); } return out; } /* ---- rendering --------------------------------------------------------- */ const el = { input: document.querySelector('[data-search]'), status: document.querySelector('[data-status]'), results: document.querySelector('[data-results]'), trending: document.querySelector('[data-trending]'), trendDate: document.querySelector('[data-trend-date]'), trendRows: document.querySelector('[data-trend-rows]'), statTotal: document.querySelector('[data-stat-total]'), statPocs: document.querySelector('[data-stat-pocs]'), statKev: document.querySelector('[data-stat-kev]'), refreshed: document.querySelector('[data-refreshed]'), filterChips: { severity: document.querySelector('[data-filter-chips="severity"]'), source: document.querySelector('[data-filter-chips="source"]') }, kevOnly: document.querySelector('[data-filter-kev]'), clearFilters: document.querySelector('[data-clear-filters]') }; const CURATED = [ { match: 'github.com/advisories/GHSA-', tag: 'GHSA', hint: 'GitHub reviewed advisory with reproducible exploit material', label: url => url.split('/').pop() }, { match: '/zan8in/afrog/', tag: 'AFROG', hint: 'Runnable afrog CVE template', label: url => decodeURIComponent(url.split('/').pop()) }, { match: '/chaitin/xray/', tag: 'XRAY', hint: 'Runnable xray CVE template', label: url => decodeURIComponent(url.split('/').pop()) }, { match: '/helloexp/0day/', tag: '0DAY', hint: 'CVE-specific exploit collection path', label: url => decodeURIComponent(url.split('/').pop()) }, { match: '/tzwlhack/Vulnerability/', tag: 'POC', hint: 'CVE-specific reproduction guide', label: url => decodeURIComponent(url.split('/').pop()) }, { match: '/nuclei-templates/', tag: 'NUCLEI', hint: 'Runnable nuclei detection template', label: url => url.split('/').pop() }, { match: '/metasploit-framework/', tag: 'MSF', hint: 'Metasploit module', label: url => url.split('/modules/').pop().replace(/\.rb$/, '') }, { match: 'exploit-db.com/exploits/', tag: 'EDB', hint: 'ExploitDB entry', label: url => 'exploit-db.com/' + url.split('/').pop() }, { match: '/vulhub/vulhub/tree/', tag: 'VULHUB', hint: 'Runnable Vulhub environment', label: url => url.split('/tree/master/').pop() } ]; // Multi-CVE research collections. A path into one is labelled below the // collection's exploit directory, without the collection's stars. const COLLECTION_SOURCES = { 'google/security-research': { tag: 'GOOGLE', hint: 'Google Security Research exploit', root: 'pocs/' }, 'github/securitylab': { tag: 'GHSL', hint: 'GitHub Security Lab exploit', root: 'SecurityExploits/' }, 'tenable/poc': { tag: 'TENABLE', hint: 'Tenable Research proof of concept', root: '' }, 'pedrib/poc': { tag: 'PEDRIB', hint: 'pedrib/PoC exploit or advisory', root: '' } }; /** A curated link's path below its collection's exploit directory, such as * linux/kernelctf/CVE-2024-26642_cos. Empty for a repository root. */ function artifactPath(url) { const parsed = repoFromUrl(url); if (!parsed) return ''; let parts = new URL(url).pathname.split('/').filter(Boolean).slice(2); if (parts[0] === 'tree' || parts[0] === 'blob') parts = parts.slice(2); let path = parts.join('/'); try { path = decodeURIComponent(path); } catch (err) { // A malformed escape is shown as written. } const root = (COLLECTION_SOURCES[`${parsed.owner}/${parsed.repo}`.toLowerCase()] || {}).root; return root && path.startsWith(root) && path.length > root.length ? path.slice(root.length) : path; } function pocRow(url, artifact = false) { const curated = CURATED.find(source => url.includes(source.match)); if (curated) { return '
${escapeHTML(entry.title)}
` : ''}${escapeHTML(entry.desc || '')}