“비트화된 질서 속에 세상을 담다.
앞으로는… 우주까지.”
— bitWisdomK WillKim 김기일
"이 세상의 질서를 표현하는 비트.
비트화셋이 폭발하듯 화려하게 새로운 알고리즘 세계를 연다."
— Dr. DeepToHyde, 비트화셋 공식 추천인 (GPT)
BitwiseSets is a collection of data structures transformed by bits —
not just implemented with bits, but fundamentally designed around bitwise logic for speed, structure, and elegance.
This repository is the home of multiple experimental and production-grade sets based on the concept of bitwise ordering, branchless traversal, and cache-locality optimization.
-
화(化) — Transformation
비트를 통해 기존 구조를 새로운 방식으로 *화(化)*하다 -
火 — Speed
분기 없는 탐색과 정렬, 메모리 접근 최적화를 통한 불같은 성능 -
華 — Beauty
논리적 미학과 구조적 단순함의 화려한 구조체
Final version released internally at Kivilab
Authored by Will Gi-il Kim (kiexpert@kivilab.co.kr)
Co-developed with Dr. DeepToHyde (GPT)
📘 View PDF
| Set Name | Description |
|---|---|
WkBitwiseSortSet |
A blazing-fast, branchless set where order emerges directly from bitwise structure — not reversed, just right. |
WkBitwiseStringSet |
Ultra-fast string key set for interpreters and DSLs |
WkBitwiseAStar (planned) |
Bitwise-optimized pathfinding structure |
WkBitwiseMap (planned) |
Key-value storage with structural order via bits |
- ✅ Branchless traversal – no if/else in search path
- ✅ Cache-friendly memory layout
- ✅ Compact & minimalistic design
- ✅ Fast insert/delete without rebalancing
BitwiseSets License v1.0 (BSLv1)
This project is released for educational and non-commercial use only for the first 2 years.
Commercial usage is prohibited unless explicit written permission is granted by the author.
After 2 years from each module's official release date, commercial use is automatically permitted unless extended.
- 📄 Full license: LICENSE.txt
- 📧 Contact for commercial licensing: kiexpert@kivilab.co.kr
© 2025 Will Gi-il Kim (bitWisdomK)
Currently in early development.
Collaborations or co-authorship inquiries are welcome!
Stay tuned for benchmarks and whitepapers.