A research overview of message-schedule structure and reduced-round compression models. No research results have been released here.
Authors
Jordi Gartner
Research status
Work in progress
Published
Version
1
Research direction
This project is concerned with mathematical structure in the SHA-256 message schedule and models of its compression function with fewer rounds. The purpose of this page is to identify that research direction and make its publication status explicit.
Current archive status
No SHA-256 manuscript, dataset or reproducibility package has been supplied to this archive. There is therefore no published result, experiment record or formal verification claim to assess here.
Any future note must specify the model, round count, assumptions and exact statement being studied. Findings in a reduced-round model must remain tied to that model. This page makes no claim of a practical weakness in SHA-256.
Next publication step
Select a self-contained research note, document its inputs and limitations, and release the supporting material as one versioned package. Until that happens, this page remains an overview.
Contributions & AI assistance
Contributions
Jordi Gartner directs this personal research archive and decides what is released. Publication-specific authorship and contributions are recorded with each work; the website alone does not establish independent scientific review.
AI assistance
This archive is prepared with AI assistance. Research records include AI-assisted exploration, programming, proof drafting and internal checks. A check by another AI agent is an internal check, not independent external review or peer review. Each released work must identify its contributors, checks and limitations.
Related releases
No releases have been published for this project yet.
Beedbyte
Comments
Discussion of version 1
No comments yet.
Comments on this version are preserved here. Comment on the current version →