mirror of
https://github.com/norandom/OpenUltraSAST.git
synced 2026-10-16 03:49:26 +00:00
Marius Ciepluch
1ae41eea19
Regex inventory stays the proposer. MAP attaches promote/demote/unadjudicated/coverage from intra-file taint (tree-sitter when a grammar parses, Python ast as last resort). Deep sandboxes promotions only, ordered by the existing heuristic ranker plus optional OpenRouter mechanism recall. The SAST pair slice scores overlay outcomes; the stage-1 detection gate and local pair gate stay inventory-only.
13 lines
363 B
Python
13 lines
363 B
Python
"""Prove-budget ranker: heuristic order plus optional mechanism recall."""
|
|
|
|
from .mechanisms import MechanismStore, append_mechanism, order_promotions
|
|
from .prove_filter import filter_promoted_hotspots, promoted_findings
|
|
|
|
__all__ = [
|
|
"MechanismStore",
|
|
"append_mechanism",
|
|
"filter_promoted_hotspots",
|
|
"order_promotions",
|
|
"promoted_findings",
|
|
]
|