trailofbits/binary_type_inference

Use more efficient datastructures for reaching definitions

Open

#45 opened on Jul 22, 2022

View on GitHub
 (0 comments) (0 reactions) (0 assignees)Rust (2 forks)auto 404
enhancementgood first issuepriority/medium

Repository metrics

Stars
 (22 stars)
PR merge metrics
 (PR metrics pending)

Description

Lots of shared structure, i think Patricia sets would be good here. Might be part of the perf issue

Contributor guide

Research direction
Research Patricia tries (radix trees) and how they can be applied to represent reaching definitions efficiently. Examine the current codebase to understand the existing representation and identify where Patricia sets can replace current structures.
Tech stack
rust
Domain
securityreverse engineering
Issue type
Performance
DifficultyEstimated implementation difficulty for a new contributor, from 1 for very small changes to 5 for expert-level work.
3
Estimated timeA rough time range for an experienced contributor to investigate, implement, test, and prepare a pull request.
1-2 days
Activity statusHow available the issue appears right now: fresh, active, stale, blocked, or waiting on maintainer input.
Active
ClarityHow clearly the issue explains the expected change, acceptance criteria, and next step.
Mostly clear
Prerequisites
Rust
Newbie friendlinessA 1-100 score estimating how approachable this issue is for first-time contributors.
40