Start doing TCP networking

CMakeLists.txt

@@ -1,6 +1,6 @@
 cmake_minimum_required(VERSION 3.16)
 
-project(miniboinc
+project(skalacoin
     VERSION 0.1.0
     LANGUAGES C CXX
 )
@@ -10,6 +10,7 @@ set(CMAKE_C_STANDARD_REQUIRED ON)
 set(CMAKE_C_EXTENSIONS OFF)
 
 find_package(Threads REQUIRED)
+include(FetchContent)
 
 # OpenSSL
 find_package(OpenSSL QUIET)
@@ -42,37 +43,52 @@ if(NOT SECP256K1_FOUND)
     endif()
 endif()
 
-# RandomX
+# Autolykos2 CPU reference backend (optional)
-set(RANDOMX_ROOT "" CACHE PATH "Root directory of a RandomX installation")
+option(SKALACOIN_ENABLE_AUTOLYKOS2_REF "Enable Autolykos2 CPU reference backend" ON)
-set(RANDOMX_USING_FETCHCONTENT OFF)
+set(SKALACOIN_AUTOLYKOS2_REF_AVAILABLE OFF)
-if(PkgConfig_FOUND)
-    pkg_check_modules(RANDOMX QUIET IMPORTED_TARGET randomx)
-endif()
 
-if(NOT RANDOMX_FOUND)
+if(SKALACOIN_ENABLE_AUTOLYKOS2_REF)
-    find_path(RANDOMX_INCLUDE_DIR
-        NAMES randomx.h
-        HINTS ${RANDOMX_ROOT}
-        PATH_SUFFIXES include
-    )
-    find_library(RANDOMX_LIBRARY
-        NAMES randomx
-        HINTS ${RANDOMX_ROOT}
-        PATH_SUFFIXES lib
-    )
-
-    if(NOT RANDOMX_INCLUDE_DIR OR NOT RANDOMX_LIBRARY)
-        include(FetchContent)
     FetchContent_Declare(
-            randomx_src
+        autolykos2_ref_src
-            GIT_REPOSITORY https://github.com/tevador/RandomX.git
+        GIT_REPOSITORY https://github.com/mhssamadani/Autolykos2_NV_Miner.git
-            GIT_TAG master
+        GIT_TAG main
         GIT_SHALLOW TRUE
     )
-        FetchContent_MakeAvailable(randomx_src)
+    FetchContent_MakeAvailable(autolykos2_ref_src)
-        set(RANDOMX_USING_FETCHCONTENT ON)
+
-        set(RANDOMX_INCLUDE_DIR ${randomx_src_SOURCE_DIR}/src)
+    set(AUTOLYKOS2_REF_BASE ${autolykos2_ref_src_SOURCE_DIR}/secp256k1)
+    set(AUTOLYKOS2_REF_SOURCES
+        ${AUTOLYKOS2_REF_BASE}/src/cpuAutolykos.cc
+        ${AUTOLYKOS2_REF_BASE}/src/conversion.cc
+        ${AUTOLYKOS2_REF_BASE}/src/cryptography.cc
+        ${AUTOLYKOS2_REF_BASE}/src/definitions.cc
+        ${AUTOLYKOS2_REF_BASE}/src/easylogging++.cc
+        ${AUTOLYKOS2_REF_BASE}/src/jsmn.c
+        ${PROJECT_SOURCE_DIR}/src/autolykos2/easylogging_init.cpp
+        ${PROJECT_SOURCE_DIR}/src/autolykos2/autolykos2_ref_wrapper.cpp
+    )
+
+    add_library(autolykos2_ref STATIC ${AUTOLYKOS2_REF_SOURCES})
+    target_include_directories(autolykos2_ref PRIVATE ${AUTOLYKOS2_REF_BASE}/include)
+    # Upstream source uses `malloc/free/exit/EXIT_FAILURE` without including
+    # stdlib headers in some C++ translation units. AppleClang can compile this,
+    # while Linux Clang fails. Force-include stdlib.h for C++ in this vendored lib.
+    if(CMAKE_CXX_COMPILER_ID MATCHES "Clang|GNU")
+        target_compile_options(autolykos2_ref PRIVATE
+            $<$<COMPILE_LANGUAGE:CXX>:-include>
+            $<$<COMPILE_LANGUAGE:CXX>:stdlib.h>
+        )
+    elseif(MSVC)
+        target_compile_options(autolykos2_ref PRIVATE
+            $<$<COMPILE_LANGUAGE:CXX>:/FIstdlib.h>
+        )
     endif()
+    target_link_libraries(autolykos2_ref PRIVATE
+        ${CMAKE_THREAD_LIBS_INIT}
+        OpenSSL::SSL
+        OpenSSL::Crypto
+    )
+    set(SKALACOIN_AUTOLYKOS2_REF_AVAILABLE ON)
 endif()
 
 # ---------------------------------------------------------
@@ -105,14 +121,8 @@ else()
     target_link_libraries(node PRIVATE ${SECP256K1_LIBRARY})
 endif()
 
-if(RANDOMX_FOUND)
+if(SKALACOIN_AUTOLYKOS2_REF_AVAILABLE)
-    target_link_libraries(node PRIVATE PkgConfig::RANDOMX)
+    target_link_libraries(node PRIVATE autolykos2_ref)
-elseif(RANDOMX_USING_FETCHCONTENT)
-    target_link_libraries(node PRIVATE randomx)
-    target_include_directories(node PRIVATE ${RANDOMX_INCLUDE_DIR})
-else()
-    target_include_directories(node PRIVATE ${RANDOMX_INCLUDE_DIR})
-    target_link_libraries(node PRIVATE ${RANDOMX_LIBRARY})
 endif()
 
 target_include_directories(node PRIVATE 
@@ -126,5 +136,6 @@ target_compile_options(node PRIVATE
 )
 target_compile_definitions(node PRIVATE
     CHAIN_DATA_DIR="${CMAKE_BINARY_DIR}/chain_data"
+    $<$<BOOL:${SKALACOIN_AUTOLYKOS2_REF_AVAILABLE}>:SKALACOIN_AUTOLYKOS2_REF_AVAILABLE>
 )
-set_target_properties(node PROPERTIES OUTPUT_NAME "minicoin_node")
+set_target_properties(node PROPERTIES OUTPUT_NAME "skalacoin_node")

LICENSE

@@ -0,0 +1,504 @@
+                  GNU LESSER GENERAL PUBLIC LICENSE
+                       Version 2.1, February 1999
+
+ Copyright (C) 1991, 1999 Free Software Foundation, Inc.
+ 51 Franklin Street, Fifth Floor, Boston, MA  02110-1301  USA
+ Everyone is permitted to copy and distribute verbatim copies
+ of this license document, but changing it is not allowed.
+
+[This is the first released version of the Lesser GPL.  It also counts
+ as the successor of the GNU Library Public License, version 2, hence
+ the version number 2.1.]
+
+                            Preamble
+
+  The licenses for most software are designed to take away your
+freedom to share and change it.  By contrast, the GNU General Public
+Licenses are intended to guarantee your freedom to share and change
+free software--to make sure the software is free for all its users.
+
+  This license, the Lesser General Public License, applies to some
+specially designated software packages--typically libraries--of the
+Free Software Foundation and other authors who decide to use it.  You
+can use it too, but we suggest you first think carefully about whether
+this license or the ordinary General Public License is the better
+strategy to use in any particular case, based on the explanations below.
+
+  When we speak of free software, we are referring to freedom of use,
+not price.  Our General Public Licenses are designed to make sure that
+you have the freedom to distribute copies of free software (and charge
+for this service if you wish); that you receive source code or can get
+it if you want it; that you can change the software and use pieces of
+it in new free programs; and that you are informed that you can do
+these things.
+
+  To protect your rights, we need to make restrictions that forbid
+distributors to deny you these rights or to ask you to surrender these
+rights.  These restrictions translate to certain responsibilities for
+you if you distribute copies of the library or if you modify it.
+
+  For example, if you distribute copies of the library, whether gratis
+or for a fee, you must give the recipients all the rights that we gave
+you.  You must make sure that they, too, receive or can get the source
+code.  If you link other code with the library, you must provide
+complete object files to the recipients, so that they can relink them
+with the library after making changes to the library and recompiling
+it.  And you must show them these terms so they know their rights.
+
+  We protect your rights with a two-step method: (1) we copyright the
+library, and (2) we offer you this license, which gives you legal
+permission to copy, distribute and/or modify the library.
+
+  To protect each distributor, we want to make it very clear that
+there is no warranty for the free library.  Also, if the library is
+modified by someone else and passed on, the recipients should know
+that what they have is not the original version, so that the original
+author's reputation will not be affected by problems that might be
+introduced by others.
+
+  Finally, software patents pose a constant threat to the existence of
+any free program.  We wish to make sure that a company cannot
+effectively restrict the users of a free program by obtaining a
+restrictive license from a patent holder.  Therefore, we insist that
+any patent license obtained for a version of the library must be
+consistent with the full freedom of use specified in this license.
+
+  Most GNU software, including some libraries, is covered by the
+ordinary GNU General Public License.  This license, the GNU Lesser
+General Public License, applies to certain designated libraries, and
+is quite different from the ordinary General Public License.  We use
+this license for certain libraries in order to permit linking those
+libraries into non-free programs.
+
+  When a program is linked with a library, whether statically or using
+a shared library, the combination of the two is legally speaking a
+combined work, a derivative of the original library.  The ordinary
+General Public License therefore permits such linking only if the
+entire combination fits its criteria of freedom.  The Lesser General
+Public License permits more lax criteria for linking other code with
+the library.
+
+  We call this license the "Lesser" General Public License because it
+does Less to protect the user's freedom than the ordinary General
+Public License.  It also provides other free software developers Less
+of an advantage over competing non-free programs.  These disadvantages
+are the reason we use the ordinary General Public License for many
+libraries.  However, the Lesser license provides advantages in certain
+special circumstances.
+
+  For example, on rare occasions, there may be a special need to
+encourage the widest possible use of a certain library, so that it becomes
+a de-facto standard.  To achieve this, non-free programs must be
+allowed to use the library.  A more frequent case is that a free
+library does the same job as widely used non-free libraries.  In this
+case, there is little to gain by limiting the free library to free
+software only, so we use the Lesser General Public License.
+
+  In other cases, permission to use a particular library in non-free
+programs enables a greater number of people to use a large body of
+free software.  For example, permission to use the GNU C Library in
+non-free programs enables many more people to use the whole GNU
+operating system, as well as its variant, the GNU/Linux operating
+system.
+
+  Although the Lesser General Public License is Less protective of the
+users' freedom, it does ensure that the user of a program that is
+linked with the Library has the freedom and the wherewithal to run
+that program using a modified version of the Library.
+
+  The precise terms and conditions for copying, distribution and
+modification follow.  Pay close attention to the difference between a
+"work based on the library" and a "work that uses the library".  The
+former contains code derived from the library, whereas the latter must
+be combined with the library in order to run.
+
+                  GNU LESSER GENERAL PUBLIC LICENSE
+   TERMS AND CONDITIONS FOR COPYING, DISTRIBUTION AND MODIFICATION
+
+  0. This License Agreement applies to any software library or other
+program which contains a notice placed by the copyright holder or
+other authorized party saying it may be distributed under the terms of
+this Lesser General Public License (also called "this License").
+Each licensee is addressed as "you".
+
+  A "library" means a collection of software functions and/or data
+prepared so as to be conveniently linked with application programs
+(which use some of those functions and data) to form executables.
+
+  The "Library", below, refers to any such software library or work
+which has been distributed under these terms.  A "work based on the
+Library" means either the Library or any derivative work under
+copyright law: that is to say, a work containing the Library or a
+portion of it, either verbatim or with modifications and/or translated
+straightforwardly into another language.  (Hereinafter, translation is
+included without limitation in the term "modification".)
+
+  "Source code" for a work means the preferred form of the work for
+making modifications to it.  For a library, complete source code means
+all the source code for all modules it contains, plus any associated
+interface definition files, plus the scripts used to control compilation
+and installation of the library.
+
+  Activities other than copying, distribution and modification are not
+covered by this License; they are outside its scope.  The act of
+running a program using the Library is not restricted, and output from
+such a program is covered only if its contents constitute a work based
+on the Library (independent of the use of the Library in a tool for
+writing it).  Whether that is true depends on what the Library does
+and what the program that uses the Library does.
+
+  1. You may copy and distribute verbatim copies of the Library's
+complete source code as you receive it, in any medium, provided that
+you conspicuously and appropriately publish on each copy an
+appropriate copyright notice and disclaimer of warranty; keep intact
+all the notices that refer to this License and to the absence of any
+warranty; and distribute a copy of this License along with the
+Library.
+
+  You may charge a fee for the physical act of transferring a copy,
+and you may at your option offer warranty protection in exchange for a
+fee.
+
+  2. You may modify your copy or copies of the Library or any portion
+of it, thus forming a work based on the Library, and copy and
+distribute such modifications or work under the terms of Section 1
+above, provided that you also meet all of these conditions:
+
+    a) The modified work must itself be a software library.
+
+    b) You must cause the files modified to carry prominent notices
+    stating that you changed the files and the date of any change.
+
+    c) You must cause the whole of the work to be licensed at no
+    charge to all third parties under the terms of this License.
+
+    d) If a facility in the modified Library refers to a function or a
+    table of data to be supplied by an application program that uses
+    the facility, other than as an argument passed when the facility
+    is invoked, then you must make a good faith effort to ensure that,
+    in the event an application does not supply such function or
+    table, the facility still operates, and performs whatever part of
+    its purpose remains meaningful.
+
+    (For example, a function in a library to compute square roots has
+    a purpose that is entirely well-defined independent of the
+    application.  Therefore, Subsection 2d requires that any
+    application-supplied function or table used by this function must
+    be optional: if the application does not supply it, the square
+    root function must still compute square roots.)
+
+These requirements apply to the modified work as a whole.  If
+identifiable sections of that work are not derived from the Library,
+and can be reasonably considered independent and separate works in
+themselves, then this License, and its terms, do not apply to those
+sections when you distribute them as separate works.  But when you
+distribute the same sections as part of a whole which is a work based
+on the Library, the distribution of the whole must be on the terms of
+this License, whose permissions for other licensees extend to the
+entire whole, and thus to each and every part regardless of who wrote
+it.
+
+Thus, it is not the intent of this section to claim rights or contest
+your rights to work written entirely by you; rather, the intent is to
+exercise the right to control the distribution of derivative or
+collective works based on the Library.
+
+In addition, mere aggregation of another work not based on the Library
+with the Library (or with a work based on the Library) on a volume of
+a storage or distribution medium does not bring the other work under
+the scope of this License.
+
+  3. You may opt to apply the terms of the ordinary GNU General Public
+License instead of this License to a given copy of the Library.  To do
+this, you must alter all the notices that refer to this License, so
+that they refer to the ordinary GNU General Public License, version 2,
+instead of to this License.  (If a newer version than version 2 of the
+ordinary GNU General Public License has appeared, then you can specify
+that version instead if you wish.)  Do not make any other change in
+these notices.
+
+  Once this change is made in a given copy, it is irreversible for
+that copy, so the ordinary GNU General Public License applies to all
+subsequent copies and derivative works made from that copy.
+
+  This option is useful when you wish to copy part of the code of
+the Library into a program that is not a library.
+
+  4. You may copy and distribute the Library (or a portion or
+derivative of it, under Section 2) in object code or executable form
+under the terms of Sections 1 and 2 above provided that you accompany
+it with the complete corresponding machine-readable source code, which
+must be distributed under the terms of Sections 1 and 2 above on a
+medium customarily used for software interchange.
+
+  If distribution of object code is made by offering access to copy
+from a designated place, then offering equivalent access to copy the
+source code from the same place satisfies the requirement to
+distribute the source code, even though third parties are not
+compelled to copy the source along with the object code.
+
+  5. A program that contains no derivative of any portion of the
+Library, but is designed to work with the Library by being compiled or
+linked with it, is called a "work that uses the Library".  Such a
+work, in isolation, is not a derivative work of the Library, and
+therefore falls outside the scope of this License.
+
+  However, linking a "work that uses the Library" with the Library
+creates an executable that is a derivative of the Library (because it
+contains portions of the Library), rather than a "work that uses the
+library".  The executable is therefore covered by this License.
+Section 6 states terms for distribution of such executables.
+
+  When a "work that uses the Library" uses material from a header file
+that is part of the Library, the object code for the work may be a
+derivative work of the Library even though the source code is not.
+Whether this is true is especially significant if the work can be
+linked without the Library, or if the work is itself a library.  The
+threshold for this to be true is not precisely defined by law.
+
+  If such an object file uses only numerical parameters, data
+structure layouts and accessors, and small macros and small inline
+functions (ten lines or less in length), then the use of the object
+file is unrestricted, regardless of whether it is legally a derivative
+work.  (Executables containing this object code plus portions of the
+Library will still fall under Section 6.)
+
+  Otherwise, if the work is a derivative of the Library, you may
+distribute the object code for the work under the terms of Section 6.
+Any executables containing that work also fall under Section 6,
+whether or not they are linked directly with the Library itself.
+
+  6. As an exception to the Sections above, you may also combine or
+link a "work that uses the Library" with the Library to produce a
+work containing portions of the Library, and distribute that work
+under terms of your choice, provided that the terms permit
+modification of the work for the customer's own use and reverse
+engineering for debugging such modifications.
+
+  You must give prominent notice with each copy of the work that the
+Library is used in it and that the Library and its use are covered by
+this License.  You must supply a copy of this License.  If the work
+during execution displays copyright notices, you must include the
+copyright notice for the Library among them, as well as a reference
+directing the user to the copy of this License.  Also, you must do one
+of these things:
+
+    a) Accompany the work with the complete corresponding
+    machine-readable source code for the Library including whatever
+    changes were used in the work (which must be distributed under
+    Sections 1 and 2 above); and, if the work is an executable linked
+    with the Library, with the complete machine-readable "work that
+    uses the Library", as object code and/or source code, so that the
+    user can modify the Library and then relink to produce a modified
+    executable containing the modified Library.  (It is understood
+    that the user who changes the contents of definitions files in the
+    Library will not necessarily be able to recompile the application
+    to use the modified definitions.)
+
+    b) Use a suitable shared library mechanism for linking with the
+    Library.  A suitable mechanism is one that (1) uses at run time a
+    copy of the library already present on the user's computer system,
+    rather than copying library functions into the executable, and (2)
+    will operate properly with a modified version of the library, if
+    the user installs one, as long as the modified version is
+    interface-compatible with the version that the work was made with.
+
+    c) Accompany the work with a written offer, valid for at
+    least three years, to give the same user the materials
+    specified in Subsection 6a, above, for a charge no more
+    than the cost of performing this distribution.
+
+    d) If distribution of the work is made by offering access to copy
+    from a designated place, offer equivalent access to copy the above
+    specified materials from the same place.
+
+    e) Verify that the user has already received a copy of these
+    materials or that you have already sent this user a copy.
+
+  For an executable, the required form of the "work that uses the
+Library" must include any data and utility programs needed for
+reproducing the executable from it.  However, as a special exception,
+the materials to be distributed need not include anything that is
+normally distributed (in either source or binary form) with the major
+components (compiler, kernel, and so on) of the operating system on
+which the executable runs, unless that component itself accompanies
+the executable.
+
+  It may happen that this requirement contradicts the license
+restrictions of other proprietary libraries that do not normally
+accompany the operating system.  Such a contradiction means you cannot
+use both them and the Library together in an executable that you
+distribute.
+
+  7. You may place library facilities that are a work based on the
+Library side-by-side in a single library together with other library
+facilities not covered by this License, and distribute such a combined
+library, provided that the separate distribution of the work based on
+the Library and of the other library facilities is otherwise
+permitted, and provided that you do these two things:
+
+    a) Accompany the combined library with a copy of the same work
+    based on the Library, uncombined with any other library
+    facilities.  This must be distributed under the terms of the
+    Sections above.
+
+    b) Give prominent notice with the combined library of the fact
+    that part of it is a work based on the Library, and explaining
+    where to find the accompanying uncombined form of the same work.
+
+  8. You may not copy, modify, sublicense, link with, or distribute
+the Library except as expressly provided under this License.  Any
+attempt otherwise to copy, modify, sublicense, link with, or
+distribute the Library is void, and will automatically terminate your
+rights under this License.  However, parties who have received copies,
+or rights, from you under this License will not have their licenses
+terminated so long as such parties remain in full compliance.
+
+  9. You are not required to accept this License, since you have not
+signed it.  However, nothing else grants you permission to modify or
+distribute the Library or its derivative works.  These actions are
+prohibited by law if you do not accept this License.  Therefore, by
+modifying or distributing the Library (or any work based on the
+Library), you indicate your acceptance of this License to do so, and
+all its terms and conditions for copying, distributing or modifying
+the Library or works based on it.
+
+  10. Each time you redistribute the Library (or any work based on the
+Library), the recipient automatically receives a license from the
+original licensor to copy, distribute, link with or modify the Library
+subject to these terms and conditions.  You may not impose any further
+restrictions on the recipients' exercise of the rights granted herein.
+You are not responsible for enforcing compliance by third parties with
+this License.
+
+  11. If, as a consequence of a court judgment or allegation of patent
+infringement or for any other reason (not limited to patent issues),
+conditions are imposed on you (whether by court order, agreement or
+otherwise) that contradict the conditions of this License, they do not
+excuse you from the conditions of this License.  If you cannot
+distribute so as to satisfy simultaneously your obligations under this
+License and any other pertinent obligations, then as a consequence you
+may not distribute the Library at all.  For example, if a patent
+license would not permit royalty-free redistribution of the Library by
+all those who receive copies directly or indirectly through you, then
+the only way you could satisfy both it and this License would be to
+refrain entirely from distribution of the Library.
+
+If any portion of this section is held invalid or unenforceable under any
+particular circumstance, the balance of the section is intended to apply,
+and the section as a whole is intended to apply in other circumstances.
+
+It is not the purpose of this section to induce you to infringe any
+patents or other property right claims or to contest validity of any
+such claims; this section has the sole purpose of protecting the
+integrity of the free software distribution system which is
+implemented by public license practices.  Many people have made
+generous contributions to the wide range of software distributed
+through that system in reliance on consistent application of that
+system; it is up to the author/donor to decide if he or she is willing
+to distribute software through any other system and a licensee cannot
+impose that choice.
+
+This section is intended to make thoroughly clear what is believed to
+be a consequence of the rest of this License.
+
+  12. If the distribution and/or use of the Library is restricted in
+certain countries either by patents or by copyrighted interfaces, the
+original copyright holder who places the Library under this License may add
+an explicit geographical distribution limitation excluding those countries,
+so that distribution is permitted only in or among countries not thus
+excluded.  In such case, this License incorporates the limitation as if
+written in the body of this License.
+
+  13. The Free Software Foundation may publish revised and/or new
+versions of the Lesser General Public License from time to time.
+Such new versions will be similar in spirit to the present version,
+but may differ in detail to address new problems or concerns.
+
+Each version is given a distinguishing version number.  If the Library
+specifies a version number of this License which applies to it and
+"any later version", you have the option of following the terms and
+conditions either of that version or of any later version published by
+the Free Software Foundation.  If the Library does not specify a
+license version number, you may choose any version ever published by
+the Free Software Foundation.
+
+  14. If you wish to incorporate parts of the Library into other free
+programs whose distribution conditions are incompatible with these,
+write to the author to ask for permission.  For software which is
+copyrighted by the Free Software Foundation, write to the Free
+Software Foundation; we sometimes make exceptions for this.  Our
+decision will be guided by the two goals of preserving the free status
+of all derivatives of our free software and of promoting the sharing
+and reuse of software generally.
+
+                            NO WARRANTY
+
+  15. BECAUSE THE LIBRARY IS LICENSED FREE OF CHARGE, THERE IS NO
+WARRANTY FOR THE LIBRARY, TO THE EXTENT PERMITTED BY APPLICABLE LAW.
+EXCEPT WHEN OTHERWISE STATED IN WRITING THE COPYRIGHT HOLDERS AND/OR
+OTHER PARTIES PROVIDE THE LIBRARY "AS IS" WITHOUT WARRANTY OF ANY
+KIND, EITHER EXPRESSED OR IMPLIED, INCLUDING, BUT NOT LIMITED TO, THE
+IMPLIED WARRANTIES OF MERCHANTABILITY AND FITNESS FOR A PARTICULAR
+PURPOSE.  THE ENTIRE RISK AS TO THE QUALITY AND PERFORMANCE OF THE
+LIBRARY IS WITH YOU.  SHOULD THE LIBRARY PROVE DEFECTIVE, YOU ASSUME
+THE COST OF ALL NECESSARY SERVICING, REPAIR OR CORRECTION.
+
+  16. IN NO EVENT UNLESS REQUIRED BY APPLICABLE LAW OR AGREED TO IN
+WRITING WILL ANY COPYRIGHT HOLDER, OR ANY OTHER PARTY WHO MAY MODIFY
+AND/OR REDISTRIBUTE THE LIBRARY AS PERMITTED ABOVE, BE LIABLE TO YOU
+FOR DAMAGES, INCLUDING ANY GENERAL, SPECIAL, INCIDENTAL OR
+CONSEQUENTIAL DAMAGES ARISING OUT OF THE USE OR INABILITY TO USE THE
+LIBRARY (INCLUDING BUT NOT LIMITED TO LOSS OF DATA OR DATA BEING
+RENDERED INACCURATE OR LOSSES SUSTAINED BY YOU OR THIRD PARTIES OR A
+FAILURE OF THE LIBRARY TO OPERATE WITH ANY OTHER SOFTWARE), EVEN IF
+SUCH HOLDER OR OTHER PARTY HAS BEEN ADVISED OF THE POSSIBILITY OF SUCH
+DAMAGES.
+
+                     END OF TERMS AND CONDITIONS
+
+           How to Apply These Terms to Your New Libraries
+
+  If you develop a new library, and you want it to be of the greatest
+possible use to the public, we recommend making it free software that
+everyone can redistribute and change.  You can do so by permitting
+redistribution under these terms (or, alternatively, under the terms of the
+ordinary General Public License).
+
+  To apply these terms, attach the following notices to the library.  It is
+safest to attach them to the start of each source file to most effectively
+convey the exclusion of warranty; and each file should have at least the
+"copyright" line and a pointer to where the full notice is found.
+
+    <one line to give the library's name and a brief idea of what it does.>
+    Copyright (C) <year>  <name of author>
+
+    This library is free software; you can redistribute it and/or
+    modify it under the terms of the GNU Lesser General Public
+    License as published by the Free Software Foundation; either
+    version 2.1 of the License, or (at your option) any later version.
+
+    This library is distributed in the hope that it will be useful,
+    but WITHOUT ANY WARRANTY; without even the implied warranty of
+    MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE.  See the GNU
+    Lesser General Public License for more details.
+
+    You should have received a copy of the GNU Lesser General Public
+    License along with this library; if not, write to the Free Software
+    Foundation, Inc., 51 Franklin Street, Fifth Floor, Boston, MA  02110-1301
+    USA
+
+Also add information on how to contact you by electronic and paper mail.
+
+You should also get your employer (if you work as a programmer) or your
+school, if any, to sign a "copyright disclaimer" for the library, if
+necessary.  Here is a sample; alter the names:
+
+  Yoyodyne, Inc., hereby disclaims all copyright interest in the
+  library `Frob' (a library for tweaking knobs) written by James Random
+  Hacker.
+
+  <signature of Ty Coon>, 1 April 1990
+  Ty Coon, President of Vice
+
+That's all there is to it!

README.md

@@ -1,8 +1,20 @@
-# MiniCoin
+# Skalacoin
 
-Basic blockchain currency implementation in C, for educational purposes. Not intended for production use.
+Privacy coin made in C. One day hopefully with a purpose beyond "educational" :)
+
+Some notes for me right now:
 
 cmake:
 ```bash
 cmake .. -DCMAKE_BUILD_TYPE=Debug -DCMAKE_C_FLAGS="-fsanitize=address -fno-omit-frame-pointer" -DCMAKE_CXX_FLAGS="-fsanitize=address -fno-omit-frame-pointer" -DCMAKE_EXE_LINKER_FLAGS="-fsanitize=address"
 ```
+
+Build with clang/clang++ (I don't want to deal with the gcc/MSVC shenangans right now)
+
+Use:
+```bash
+./bin/skalacoin_node <-mine>
+```
+
+Main Hashing Algorithm: SHA256d (double SHA256) for now.
+Proof-of-Work Algorithm: Autolykos2

TODO.txt

@@ -1,2 +1,15 @@
+TODO:
+Implement Horizen's "Reorg Penalty" system to make it harder for the young chain to be attacked by a powerful miner.
+
+Make transactions private. A bit more work, but it's a challenge worth taking on.
+I want to make an "optional privacy" system, where the TX can be public or private. Of course private TXs need more bytes, so the fees (although low) will be higher for them.
+I need to figure out a way to make the privacy work without a UTXO system, and instead, with a "Balance Sheet" approach.
+
+Move the Networking Code to support win32 as well, as I'm just doing POSIX right now
+
+DONE:
+I want to move away from the Monero emission. I want to do something a bit radical for cryptocurrency, but I feel like it's necessary to make it more like money:
+a constant inflation rate of 1.5% per year. It's lower than fiat (USD is ~2.8% per year), and it additionally doesn't fluctuate during crisis. It's constant.
+
 Move to a GPU algo. RandomX is a good candidate, but CPU mining is not that attractive to anyone but people who actually want to support the project.
-It won't incentivize people who want to profit, which let's be fair, is the majority of miners.
+Sadly, CPUs won't incentivize people who want to profit, which let's be fair, is the majority of miners.

include/autolykos2/autolykos2.h

@@ -0,0 +1,59 @@
+#ifndef SKALACOIN_AUTOLYKOS2_H
+#define SKALACOIN_AUTOLYKOS2_H
+
+#include <stdbool.h>
+#include <stddef.h>
+#include <stdint.h>
+#include <constants.h>
+
+#ifdef __cplusplus
+extern "C" {
+#endif
+
+typedef struct Autolykos2Context Autolykos2Context;
+
+Autolykos2Context* Autolykos2_Create(void);
+void Autolykos2_Destroy(Autolykos2Context* ctx);
+
+bool Autolykos2_DagAllocate(Autolykos2Context* ctx, size_t bytes);
+bool Autolykos2_DagAppend(Autolykos2Context* ctx, const uint8_t* data, size_t len);
+bool Autolykos2_DagGenerate(Autolykos2Context* ctx, const uint8_t seed32[32]);
+void Autolykos2_DagClear(Autolykos2Context* ctx);
+size_t Autolykos2_DagSize(const Autolykos2Context* ctx);
+
+bool Autolykos2_Hash(
+	Autolykos2Context* ctx,
+	const uint8_t* message,
+	size_t messageLen,
+	uint64_t nonce,
+	uint64_t height,
+	uint8_t outHash[32]
+);
+
+bool Autolykos2_LightHash(const uint8_t* seed, blockchain_t* chain, uint64_t nonce, uint8_t* out);
+
+bool Autolykos2_CheckTarget(
+	Autolykos2Context* ctx,
+	const uint8_t message32[32],
+	uint64_t nonce,
+	uint64_t height,
+	const uint8_t target32[32],
+	uint8_t outHash[32]
+);
+
+bool Autolykos2_FindNonceSingleCore(
+	Autolykos2Context* ctx,
+	const uint8_t message32[32],
+	uint64_t height,
+	const uint8_t target32[32],
+	uint64_t startNonce,
+	uint64_t maxIterations,
+	uint64_t* outNonce,
+	uint8_t outHash[32]
+);
+
+#ifdef __cplusplus
+}
+#endif
+
+#endif

include/balance_sheet.h

@@ -2,10 +2,47 @@
 #define BALANCE_SHEET_H
 
 #include <stdint.h>
+#include <dynarr.h>
+#include <stdbool.h>
+#include <stdlib.h>
+#include <stdio.h>
+#include <khash/khash.h>
+#include <crypto/crypto.h>
+#include <string.h>
+#include <uint256.h>
+
+typedef struct {
+    uint8_t bytes[32];
+} key32_t;
 
 typedef struct {
     uint8_t address[32]; // For now just the SHA-256 of the public key; allows representation in different encodings (base58, bech32, etc) without changing the underlying data structure
-    uint64_t balance;
+    uint256_t balance;
+    // TODO: Additional things
 } balance_sheet_entry_t;
 
+static inline uint32_t hash_key32(key32_t k) {
+    uint32_t hash = 2166136261u;
+    for (int i = 0; i < 32; i++) {
+        hash ^= k.bytes[i];
+        hash *= 16777619;
+    }
+    return hash;
+}
+
+static inline int eq_key32(key32_t a, key32_t b) {
+    return memcmp(a.bytes, b.bytes, 32) == 0;
+}
+
+KHASH_INIT(balance_sheet_map_m, key32_t, balance_sheet_entry_t, 1, hash_key32, eq_key32)
+extern khash_t(balance_sheet_map_m)* sheetMap;
+
+void BalanceSheet_Init();
+int BalanceSheet_Insert(balance_sheet_entry_t entry);
+bool BalanceSheet_Lookup(uint8_t* address, balance_sheet_entry_t* out);
+bool BalanceSheet_SaveToFile(const char* outPath);
+bool BalanceSheet_LoadFromFile(const char* inPath); 
+void BalanceSheet_Print();
+void BalanceSheet_Destroy();
+
 #endif

include/blake2/blake2.h

@@ -0,0 +1,14 @@
+#ifndef SKALACOIN_BLAKE2_H
+#define SKALACOIN_BLAKE2_H
+
+#include <stdbool.h>
+#include <stddef.h>
+#include <stdint.h>
+
+#define SKALACOIN_BLAKE2B_OUTBYTES 64
+#define SKALACOIN_BLAKE2S_OUTBYTES 32
+
+bool Blake2b_Hash(const uint8_t* input, size_t inputLen, uint8_t* out, size_t outLen);
+bool Blake2s_Hash(const uint8_t* input, size_t inputLen, uint8_t* out, size_t outLen);
+
+#endif

include/block/block.h

@@ -7,9 +7,9 @@
 #include <block/transaction.h>
 #include <stdbool.h>
 #include <string.h>
-#include <randomx/librx_wrapper.h>
 #include <stdlib.h>
 
+#pragma pack(push, 1) // Ensure no padding for consistent file storage
 typedef struct {
     uint64_t blockNumber;
     uint64_t timestamp;
@@ -20,20 +20,23 @@ typedef struct {
     uint8_t version;
     uint8_t reserved[3];       // 3 bytes (Explicit padding for 8-byte alignment)
 } block_header_t;
+#pragma pack(pop)
 
 typedef struct {
     block_header_t header;
-    DynArr* transactions; // Array of signed_transaction_t
+    DynArr* transactions; // Array of signed_transaction_t, NOTE: Potentially move to a hashmap at some point for quick lookups.
 } block_t;
 
 block_t* Block_Create();
 void Block_CalculateHash(const block_t* block, uint8_t* outHash);
 void Block_CalculateMerkleRoot(const block_t* block, uint8_t* outHash);
-void Block_CalculateRandomXHash(const block_t* block, uint8_t* outHash);
+void Block_CalculateAutolykos2Hash(const block_t* block, uint8_t* outHash);
+bool Block_RebuildAutolykos2Dag(size_t dagBytes, const uint8_t seed32[32]);
 void Block_AddTransaction(block_t* block, signed_transaction_t* tx);
 void Block_RemoveTransaction(block_t* block, uint8_t* txHash);
 bool Block_HasValidProofOfWork(const block_t* block);
 bool Block_AllTransactionsValid(const block_t* block);
+void Block_ShutdownPowContext(void);
 void Block_Destroy(block_t* block);
 void Block_Print(const block_t* block);
 

include/block/chain.h

@@ -7,8 +7,9 @@
 #include <stdio.h>
 #include <stdbool.h>
 #include <string.h>
-#include <constants.h>
 #include <uint256.h>
+#include <storage/block_table.h>
+#include <balance_sheet.h>
 
 typedef struct {
     DynArr* blocks;
@@ -24,7 +25,10 @@ bool Chain_IsValid(blockchain_t* chain);
 void Chain_Wipe(blockchain_t* chain);
 
 // I/O
-bool Chain_SaveToFile(blockchain_t* chain, const char* dirpath, uint256_t currentSupply);
+bool Chain_SaveToFile(blockchain_t* chain, const char* dirpath, uint256_t currentSupply, uint64_t currentReward);
-bool Chain_LoadFromFile(blockchain_t* chain, const char* dirpath, uint256_t* outCurrentSupply);
+bool Chain_LoadFromFile(blockchain_t* chain, const char* dirpath, uint256_t* outCurrentSupply, uint32_t* outDifficultyTarget, uint64_t* outCurrentReward, uint8_t* outLastSavedHash);
+
+// Difficulty
+uint32_t Chain_ComputeNextTarget(blockchain_t* chain, uint32_t currentTarget);
 
 #endif

include/block/transaction.h

@@ -20,19 +20,30 @@ static inline bool Address_IsCoinbase(const uint8_t address[32]) {
     return true;
 }
 
-// 178 bytes total for v1
+// 160 bytes total for v1
+#pragma pack(push, 1) // Ensure no padding for consistent file storage
 typedef struct {
-    uint8_t version;
-    uint8_t senderAddress[32];
-    uint8_t recipientAddress[32];
-    uint64_t amount;
     uint64_t fee; // Rewarded to the miner; can be zero, but the miner may choose to ignore transactions with very low fees
-    uint8_t compressedPublicKey[33];
+    uint64_t amount1;
+    uint64_t amount2;
+    // Only one "input" sender address
+    uint8_t senderAddress[32];
+    // The "main" recepient address and amount. This is the only required output, and is used for calculating the transaction hash and signature.
+    uint8_t recipientAddress1[32];
+    // The "extra" recepient address and amount. This can safely be NULL/0 if not used and has multiple uses:
+    // - Sending zero: parital spend, sender keeps coins on the same address
+    // - Sending to a different address: normal spend, sender's coins move to a new address, e.g. change address
+    // - Private Transactions: Can nullify the whole original stealth address input (sender) and send change to a new stealth address (recipient 2) to obfuscate the transaction graph.
+    // Note that coinbase will have this as NULL/0 (for now, but we could have multiple payouts in the future)
+    uint8_t recipientAddress2[32];
     // Timestamp is dictated by the block
+    uint8_t compressedPublicKey[33];
+    uint8_t version;
+    uint8_t reserved[6]; // 6 bytes (Explicit padding for 8-byte alignment)
 } transaction_t;
+#pragma pack(pop)
 
 typedef struct {
-    uint8_t txHash[32];
     uint8_t signature[64]; // Signature of the hash
 } transaction_sig_t;
 
@@ -41,6 +52,7 @@ typedef struct {
     transaction_sig_t signature;
 } signed_transaction_t;
 
+void Transaction_Init(signed_transaction_t* tx);
 void Transaction_CalculateHash(const signed_transaction_t* tx, uint8_t* outHash);
 void Transaction_Sign(signed_transaction_t* tx, const uint8_t* privateKey);
 bool Transaction_Verify(const signed_transaction_t* tx);

include/constants.h

@@ -4,43 +4,213 @@
 #include <stdint.h>
 #include <uint256.h>
 #include <stdbool.h>
+#include <block/chain.h>
+#include <block/block.h>
 
+// Nets
+#define MAX_CONS 32 // Some baseline for now
+#define LISTEN_PORT 9393
+
+// Economics
 #define DECIMALS 1000000000000ULL
-#define DIFFICULTY_ADJUSTMENT_INTERVAL 960 // Every 960 blocks (roughly every 24 hours with a 90 second block time)
+#define DIFFICULTY_ADJUSTMENT_INTERVAL 3840 // Every 3840 blocks (roughly every 4 days with a 90 second block time)
                                            // Max adjustment per is x2. So if blocks are coming in too fast, the difficulty will at most double every 24 hours, and vice versa if they're coming in too slow.
-#define RANDOMX_KEY_ROTATION_INTERVAL 6720 // 1 week at 90s block time
 #define TARGET_BLOCK_TIME 90 // Target block time in seconds
+//#define INITIAL_DIFFICULTY 0x1f0c1422 // Default compact target used by Autolykos2 PoW (This is ridiculously low)
+#define INITIAL_DIFFICULTY 0x1f1b7c51 // This takes 90s on my machine with a single thread, good for testing
+
+// Reward schedule acceleration: 1 means normal-speed progression.
+#define EMISSION_ACCELERATION_FACTOR 1ULL
+
+// Phase-one target horizon: emit ~2^64-1 atomic units by this many blocks at x1.
+#define PHASE1_TARGET_BLOCKS 3000000ULL
+
+// Inflation is expressed in tenths of a percent to preserve integer math.
+#define INFLATION_PERCENTAGE_PER_EPOCH_TENTHS 15ULL // 1.5%
+
+// Monero-style main emission: reward = (MONEY_SUPPLY - generated) >> speed factor.
+// Keep this at 20 to match the canonical curve shape against a 2^64 atomic supply cap.
+#define MONERO_EMISSION_SPEED_FACTOR 20U
+
+// Future Autolykos2 constants:
+#define EPOCH_LENGTH 350000 // ~1 year at 90s
+#define DAG_BASE_GROWTH (1ULL << 30) // 1 GB per epoch, adjusted by acceleration
+//#define DAG_BASE_SIZE (6ULL << 30) // 6 GB, adjusted per cycle based off DAG_BASE_GROWTH
+#define DAG_BASE_SIZE (1ULL << 30) // TEMPORARY FOR TESTING
+// Swings - calculated as MIN(percentage, absolute GB) to prevent absurd swings from low hashrate or very large DAG growth
+#define DAG_MAX_UP_SWING_PERCENTAGE 1.15 // 15%
+#define DAG_MAX_DOWN_SWING_PERCENTAGE 0.90 // 10%
+#define DAG_MAX_UP_SWING_GB (2ULL << 30) // 2 GB
+#define DAG_MAX_DOWN_SWING_GB (1ULL << 30) // 1 GB
+#define DAG_GENESIS_SEED 0x00 // Genesis seed is zeroes, every epoch's seed is the hash of the previous block, therefore unpredictable until the block is mined
+
+/**
+ * Each epoch has 2 phases, connected logarithmically:
+ * - Phase 1: Aggressive DAG growth (target is ~75% of the max cap) to kick out any ASICs, 30k blocks (roughly 1 month)
+ * - Phase 2: Stable DAG growth (target is the max cap) to provide a stable environment for GPU miners, 320k blocks (roughly 11 months)
+**/
+
 static const uint64_t M_CAP = 18446744073709551615ULL; // Max uint64
-static const uint64_t TAIL_EMISSION = DECIMALS; // Emission floor is 1.0 coins per block
+static const uint64_t TAIL_EMISSION = 750000000000ULL; // 0.75 coins per block floor
+static uint64_t currentReward = 750000000000ULL; // Epoch reward cache for phase 3
 // No max supply. Instead of halving, it'll follow a more gradual, Monero-like emission curve.
 
 static uint256_t currentSupply = {{0, 0, 0, 0}}; // Global variable to track total supply; updated with each block mined
 
-static inline uint64_t CalculateBlockReward(uint256_t currentSupply, uint64_t height) {
+// Phase 3: update once per effective epoch and keep a fixed per-block reward for that epoch.
-    // Inclusive of block 0
+static inline uint64_t GetInflationRateReward(uint256_t currentSupply, blockchain_t* chain) {
-    (void)height;
+    if (!chain || !chain->blocks) { return 0x00; } // Invalid
+    size_t height = Chain_Size(chain);
+    const uint64_t effectiveEpochLength =
+        (EPOCH_LENGTH / EMISSION_ACCELERATION_FACTOR) > 0
+            ? (EPOCH_LENGTH / EMISSION_ACCELERATION_FACTOR)
+            : 1;
+
+    if (height == 0) {
+        currentReward = TAIL_EMISSION;
+        return currentReward;
+    }
+    
+    if (height % effectiveEpochLength == 0) {
+        // inflationPerBlock = currentSupply * 1.5% / effectiveEpochLength
+        // = currentSupply * 15 / (1000 * effectiveEpochLength)
+        uint256_t multiplied = uint256_from_u64(0);
+        for (uint64_t i = 0; i < INFLATION_PERCENTAGE_PER_EPOCH_TENTHS; ++i) {
+            uint256_add(&multiplied, &currentSupply);
+        }
+
+        uint64_t divisor = 1000ULL * effectiveEpochLength;
+        uint256_t quotient = {{0, 0, 0, 0}};
+        unsigned __int128 remainder = 0;
+
+        // Work from the most significant limb to the least
+        for (int i = 3; i >= 0; i--) {
+            unsigned __int128 current = (remainder << 64) | multiplied.limbs[i];
+            quotient.limbs[i] = (uint64_t)(current / divisor);
+            remainder = current % divisor;
+        }
+
+        uint64_t inflationPerBlock = quotient.limbs[0];
+        currentReward = (inflationPerBlock > TAIL_EMISSION) ? inflationPerBlock : TAIL_EMISSION;
+        return currentReward;
+    }
+
+    return (currentReward > TAIL_EMISSION) ? currentReward : TAIL_EMISSION;
+}
+
+static inline uint64_t CalculateBlockReward(uint256_t currentSupply, blockchain_t* chain) {
+    if (!chain || !chain->blocks) { return 0x00; } // Invalid
+
+    const uint64_t effectivePhase1Blocks =
+        (PHASE1_TARGET_BLOCKS / EMISSION_ACCELERATION_FACTOR) > 0
+            ? (PHASE1_TARGET_BLOCKS / EMISSION_ACCELERATION_FACTOR)
+            : 1;
+    const uint64_t height = (uint64_t)Chain_Size(chain);
+
+    // After the phase-one target horizon, only floor/inflation schedule applies.
+    if (height >= effectivePhase1Blocks) {
+        return GetInflationRateReward(currentSupply, chain);
+    }
 
     if (currentSupply.limbs[1] > 0 || 
         currentSupply.limbs[2] > 0 || 
         currentSupply.limbs[3] > 0 || 
-        currentSupply.limbs[0] >= M_CAP) {
+        currentSupply.limbs[0] >= M_CAP)
-        return TAIL_EMISSION;
+    {
+        // Post-Monero phase with unlimited supply: floor/inflation schedule only.
+        return GetInflationRateReward(currentSupply, chain);
     }
 
-    uint64_t supply_64 = currentSupply.limbs[0];
+    const uint64_t generated = currentSupply.limbs[0];
+    const uint64_t remaining = M_CAP - generated;
 
-    // Formula: ((M - Supply) >> 20) * 181 / 256
+    // Monero-style base curve against ~2^64 atomic-unit terminal supply.
-    // Use 128-bit intermediate to avoid overflow while preserving integer math.
+    uint64_t reward = remaining >> MONERO_EMISSION_SPEED_FACTOR;
-    __uint128_t rewardWide = (((__uint128_t)(M_CAP - supply_64) >> 20) * 181u) >> 8;
-    uint64_t reward = (rewardWide > UINT64_MAX) ? UINT64_MAX : (uint64_t)rewardWide;
-    // At a block time of ~90s and a floor of 1.0 coins, this will make a curve of ~8.5 years
 
-    // Check if the calculated reward has fallen below the floor
+    // Acceleration preserves curve shape while reaching the floor sooner in block-height terms.
-    if (reward < TAIL_EMISSION) {
+    if (EMISSION_ACCELERATION_FACTOR > 1ULL && reward > 0ULL) {
-        return TAIL_EMISSION;
+        __uint128_t accelerated = (__uint128_t)reward * (__uint128_t)EMISSION_ACCELERATION_FACTOR;
+        reward = (accelerated > (__uint128_t)remaining) ? remaining : (uint64_t)accelerated;
     }
 
+    // Retarget phase one to finish by PHASE1_TARGET_BLOCKS (x1), while keeping
+    // Monero-style behavior as the preferred curve when it is already sufficient.
+    const uint64_t blocksLeft = effectivePhase1Blocks - height;
+    const uint64_t minRewardToFinish = (remaining + blocksLeft - 1ULL) / blocksLeft; // ceil(remaining / blocksLeft)
+    if (reward < minRewardToFinish) {
+        reward = minRewardToFinish;
+    }
+    if (reward > remaining) {
+        reward = remaining;
+    }
+
+    // Phase 1 until Monero reward goes below the floor.
+    if (reward > TAIL_EMISSION) {
         return reward;
     }
 
+    // Phase 2 + 3: floor and epoch inflation updates.
+    return GetInflationRateReward(currentSupply, chain);
+}
+
+// Hashing DAG
+#include <math.h>
+static inline size_t CalculateTargetDAGSize(blockchain_t* chain) {
+    // Base size plus (base growth * difficulty factor), adjusted by acceleration
+    if (!chain || !chain->blocks) { return 0; } // Invalid
+    uint64_t height = (uint64_t)Chain_Size(chain);
+    
+    if (height < EPOCH_LENGTH) {
+        return DAG_BASE_SIZE;
+    }
+
+    // Get the height - EPOCH_LENGTH block and the last block;
+    block_t* lastBlock = Chain_GetBlock(chain, Chain_Size(chain) - 1);
+    block_t* epochStartBlock = Chain_GetBlock(chain, (size_t)(Chain_Size(chain) - 1 - EPOCH_LENGTH));
+    if (!lastBlock || !epochStartBlock) {
+        return 0; // Invalid
+    }
+
+    int64_t difficultyDelta = (int64_t)epochStartBlock->header.difficultyTarget - (int64_t)lastBlock->header.difficultyTarget;
+    int64_t growth = (DAG_BASE_GROWTH * difficultyDelta); // Can be negative if difficulty has decreased, which is why we use int64_t
+
+    // Clamp
+    if (growth > 0) {
+        // Difficulty increased -> Clamp the UPWARD swing
+        int64_t maxUp = (int64_t)((DAG_BASE_SIZE * 15) / 100); // 15%
+        if (growth > maxUp) growth = maxUp;
+        if (growth > (int64_t)DAG_MAX_UP_SWING_GB) growth = DAG_MAX_UP_SWING_GB;
+    } else {
+        // Difficulty decreased -> Clamp the DOWNWARD swing
+        int64_t maxDown = (int64_t)((DAG_BASE_SIZE * 10) / 100); // 10%
+        if (-growth > maxDown) growth = -maxDown;
+        if (-growth > (int64_t)DAG_MAX_DOWN_SWING_GB) growth = -(int64_t)DAG_MAX_DOWN_SWING_GB;
+    }
+    
+    int64_t targetSize = (int64_t)DAG_BASE_SIZE + growth;
+    if (targetSize <= 0) {
+        return 0;
+    }
+
+    return (size_t)targetSize;
+}
+
+static inline void GetNextDAGSeed(blockchain_t* chain, uint8_t outSeed[32]) {
+    if (!chain || !chain->blocks || !outSeed) { return; } // Invalid
+    uint64_t height = (uint64_t)Chain_Size(chain);
+
+    if (height < EPOCH_LENGTH) {
+        memset(outSeed, DAG_GENESIS_SEED, 32);
+        return;
+    }
+
+    block_t* prevBlock = Chain_GetBlock(chain, Chain_Size(chain) - 1);
+    if (!prevBlock) {
+        memset(outSeed, 0x00, 32); // Fallback to zeroes if we can't get the previous block for some reason; The caller should treat this as an error if height >= EPOCH_LENGTH
+        return;
+    }
+
+    Block_CalculateHash(prevBlock, outSeed);
+}
+
 #endif

include/crypto/crypto.h

@@ -9,5 +9,6 @@
 
 bool Crypto_VerifySignature(const uint8_t* data, size_t len, const uint8_t* signature, const uint8_t* publicKey);
 void Crypto_SignData(const uint8_t* data, size_t len, const uint8_t* privateKey, uint8_t* outSignature);
+void to_hex(const uint8_t *in, char *out);
 
 #endif

include/khash/khash.h

@@ -0,0 +1,627 @@
+/* The MIT License
+
+   Copyright (c) 2008, 2009, 2011 by Attractive Chaos <attractor@live.co.uk>
+
+   Permission is hereby granted, free of charge, to any person obtaining
+   a copy of this software and associated documentation files (the
+   "Software"), to deal in the Software without restriction, including
+   without limitation the rights to use, copy, modify, merge, publish,
+   distribute, sublicense, and/or sell copies of the Software, and to
+   permit persons to whom the Software is furnished to do so, subject to
+   the following conditions:
+
+   The above copyright notice and this permission notice shall be
+   included in all copies or substantial portions of the Software.
+
+   THE SOFTWARE IS PROVIDED "AS IS", WITHOUT WARRANTY OF ANY KIND,
+   EXPRESS OR IMPLIED, INCLUDING BUT NOT LIMITED TO THE WARRANTIES OF
+   MERCHANTABILITY, FITNESS FOR A PARTICULAR PURPOSE AND
+   NONINFRINGEMENT. IN NO EVENT SHALL THE AUTHORS OR COPYRIGHT HOLDERS
+   BE LIABLE FOR ANY CLAIM, DAMAGES OR OTHER LIABILITY, WHETHER IN AN
+   ACTION OF CONTRACT, TORT OR OTHERWISE, ARISING FROM, OUT OF OR IN
+   CONNECTION WITH THE SOFTWARE OR THE USE OR OTHER DEALINGS IN THE
+   SOFTWARE.
+*/
+
+/*
+  An example:
+
+#include "khash.h"
+KHASH_MAP_INIT_INT(32, char)
+int main() {
+	int ret, is_missing;
+	khiter_t k;
+	khash_t(32) *h = kh_init(32);
+	k = kh_put(32, h, 5, &ret);
+	kh_value(h, k) = 10;
+	k = kh_get(32, h, 10);
+	is_missing = (k == kh_end(h));
+	k = kh_get(32, h, 5);
+	kh_del(32, h, k);
+	for (k = kh_begin(h); k != kh_end(h); ++k)
+		if (kh_exist(h, k)) kh_value(h, k) = 1;
+	kh_destroy(32, h);
+	return 0;
+}
+*/
+
+/*
+  2013-05-02 (0.2.8):
+
+	* Use quadratic probing. When the capacity is power of 2, stepping function
+	  i*(i+1)/2 guarantees to traverse each bucket. It is better than double
+	  hashing on cache performance and is more robust than linear probing.
+
+	  In theory, double hashing should be more robust than quadratic probing.
+	  However, my implementation is probably not for large hash tables, because
+	  the second hash function is closely tied to the first hash function,
+	  which reduce the effectiveness of double hashing.
+
+	Reference: http://research.cs.vt.edu/AVresearch/hashing/quadratic.php
+
+  2011-12-29 (0.2.7):
+
+    * Minor code clean up; no actual effect.
+
+  2011-09-16 (0.2.6):
+
+	* The capacity is a power of 2. This seems to dramatically improve the
+	  speed for simple keys. Thank Zilong Tan for the suggestion. Reference:
+
+	   - http://code.google.com/p/ulib/
+	   - http://nothings.org/computer/judy/
+
+	* Allow to optionally use linear probing which usually has better
+	  performance for random input. Double hashing is still the default as it
+	  is more robust to certain non-random input.
+
+	* Added Wang's integer hash function (not used by default). This hash
+	  function is more robust to certain non-random input.
+
+  2011-02-14 (0.2.5):
+
+    * Allow to declare global functions.
+
+  2009-09-26 (0.2.4):
+
+    * Improve portability
+
+  2008-09-19 (0.2.3):
+
+	* Corrected the example
+	* Improved interfaces
+
+  2008-09-11 (0.2.2):
+
+	* Improved speed a little in kh_put()
+
+  2008-09-10 (0.2.1):
+
+	* Added kh_clear()
+	* Fixed a compiling error
+
+  2008-09-02 (0.2.0):
+
+	* Changed to token concatenation which increases flexibility.
+
+  2008-08-31 (0.1.2):
+
+	* Fixed a bug in kh_get(), which has not been tested previously.
+
+  2008-08-31 (0.1.1):
+
+	* Added destructor
+*/
+
+
+#ifndef __AC_KHASH_H
+#define __AC_KHASH_H
+
+/*!
+  @header
+
+  Generic hash table library.
+ */
+
+#define AC_VERSION_KHASH_H "0.2.8"
+
+#include <stdlib.h>
+#include <string.h>
+#include <limits.h>
+
+/* compiler specific configuration */
+
+#if UINT_MAX == 0xffffffffu
+typedef unsigned int khint32_t;
+#elif ULONG_MAX == 0xffffffffu
+typedef unsigned long khint32_t;
+#endif
+
+#if ULONG_MAX == ULLONG_MAX
+typedef unsigned long khint64_t;
+#else
+typedef unsigned long long khint64_t;
+#endif
+
+#ifndef kh_inline
+#ifdef _MSC_VER
+#define kh_inline __inline
+#else
+#define kh_inline inline
+#endif
+#endif /* kh_inline */
+
+#ifndef klib_unused
+#if (defined __clang__ && __clang_major__ >= 3) || (defined __GNUC__ && __GNUC__ >= 3)
+#define klib_unused __attribute__ ((__unused__))
+#else
+#define klib_unused
+#endif
+#endif /* klib_unused */
+
+typedef khint32_t khint_t;
+typedef khint_t khiter_t;
+
+#define __ac_isempty(flag, i) ((flag[i>>4]>>((i&0xfU)<<1))&2)
+#define __ac_isdel(flag, i) ((flag[i>>4]>>((i&0xfU)<<1))&1)
+#define __ac_iseither(flag, i) ((flag[i>>4]>>((i&0xfU)<<1))&3)
+#define __ac_set_isdel_false(flag, i) (flag[i>>4]&=~(1ul<<((i&0xfU)<<1)))
+#define __ac_set_isempty_false(flag, i) (flag[i>>4]&=~(2ul<<((i&0xfU)<<1)))
+#define __ac_set_isboth_false(flag, i) (flag[i>>4]&=~(3ul<<((i&0xfU)<<1)))
+#define __ac_set_isdel_true(flag, i) (flag[i>>4]|=1ul<<((i&0xfU)<<1))
+
+#define __ac_fsize(m) ((m) < 16? 1 : (m)>>4)
+
+#ifndef kroundup32
+#define kroundup32(x) (--(x), (x)|=(x)>>1, (x)|=(x)>>2, (x)|=(x)>>4, (x)|=(x)>>8, (x)|=(x)>>16, ++(x))
+#endif
+
+#ifndef kcalloc
+#define kcalloc(N,Z) calloc(N,Z)
+#endif
+#ifndef kmalloc
+#define kmalloc(Z) malloc(Z)
+#endif
+#ifndef krealloc
+#define krealloc(P,Z) realloc(P,Z)
+#endif
+#ifndef kfree
+#define kfree(P) free(P)
+#endif
+
+static const double __ac_HASH_UPPER = 0.77;
+
+#define __KHASH_TYPE(name, khkey_t, khval_t) \
+	typedef struct kh_##name##_s { \
+		khint_t n_buckets, size, n_occupied, upper_bound; \
+		khint32_t *flags; \
+		khkey_t *keys; \
+		khval_t *vals; \
+	} kh_##name##_t;
+
+#define __KHASH_PROTOTYPES(name, khkey_t, khval_t)	 					\
+	extern kh_##name##_t *kh_init_##name(void);							\
+	extern void kh_destroy_##name(kh_##name##_t *h);					\
+	extern void kh_clear_##name(kh_##name##_t *h);						\
+	extern khint_t kh_get_##name(const kh_##name##_t *h, khkey_t key); 	\
+	extern int kh_resize_##name(kh_##name##_t *h, khint_t new_n_buckets); \
+	extern khint_t kh_put_##name(kh_##name##_t *h, khkey_t key, int *ret); \
+	extern void kh_del_##name(kh_##name##_t *h, khint_t x);
+
+#define __KHASH_IMPL(name, SCOPE, khkey_t, khval_t, kh_is_map, __hash_func, __hash_equal) \
+	SCOPE kh_##name##_t *kh_init_##name(void) {							\
+		return (kh_##name##_t*)kcalloc(1, sizeof(kh_##name##_t));		\
+	}																	\
+	SCOPE void kh_destroy_##name(kh_##name##_t *h)						\
+	{																	\
+		if (h) {														\
+			kfree((void *)h->keys); kfree(h->flags);					\
+			kfree((void *)h->vals);										\
+			kfree(h);													\
+		}																\
+	}																	\
+	SCOPE void kh_clear_##name(kh_##name##_t *h)						\
+	{																	\
+		if (h && h->flags) {											\
+			memset(h->flags, 0xaa, __ac_fsize(h->n_buckets) * sizeof(khint32_t)); \
+			h->size = h->n_occupied = 0;								\
+		}																\
+	}																	\
+	SCOPE khint_t kh_get_##name(const kh_##name##_t *h, khkey_t key) 	\
+	{																	\
+		if (h->n_buckets) {												\
+			khint_t k, i, last, mask, step = 0; \
+			mask = h->n_buckets - 1;									\
+			k = __hash_func(key); i = k & mask;							\
+			last = i; \
+			while (!__ac_isempty(h->flags, i) && (__ac_isdel(h->flags, i) || !__hash_equal(h->keys[i], key))) { \
+				i = (i + (++step)) & mask; \
+				if (i == last) return h->n_buckets;						\
+			}															\
+			return __ac_iseither(h->flags, i)? h->n_buckets : i;		\
+		} else return 0;												\
+	}																	\
+	SCOPE int kh_resize_##name(kh_##name##_t *h, khint_t new_n_buckets) \
+	{ /* This function uses 0.25*n_buckets bytes of working space instead of [sizeof(key_t+val_t)+.25]*n_buckets. */ \
+		khint32_t *new_flags = 0;										\
+		khint_t j = 1;													\
+		{																\
+			kroundup32(new_n_buckets); 									\
+			if (new_n_buckets < 4) new_n_buckets = 4;					\
+			if (h->size >= (khint_t)(new_n_buckets * __ac_HASH_UPPER + 0.5)) j = 0;	/* requested size is too small */ \
+			else { /* hash table size to be changed (shrink or expand); rehash */ \
+				new_flags = (khint32_t*)kmalloc(__ac_fsize(new_n_buckets) * sizeof(khint32_t));	\
+				if (!new_flags) return -1;								\
+				memset(new_flags, 0xaa, __ac_fsize(new_n_buckets) * sizeof(khint32_t)); \
+				if (h->n_buckets < new_n_buckets) {	/* expand */		\
+					khkey_t *new_keys = (khkey_t*)krealloc((void *)h->keys, new_n_buckets * sizeof(khkey_t)); \
+					if (!new_keys) { kfree(new_flags); return -1; }		\
+					h->keys = new_keys;									\
+					if (kh_is_map) {									\
+						khval_t *new_vals = (khval_t*)krealloc((void *)h->vals, new_n_buckets * sizeof(khval_t)); \
+						if (!new_vals) { kfree(new_flags); return -1; }	\
+						h->vals = new_vals;								\
+					}													\
+				} /* otherwise shrink */								\
+			}															\
+		}																\
+		if (j) { /* rehashing is needed */								\
+			for (j = 0; j != h->n_buckets; ++j) {						\
+				if (__ac_iseither(h->flags, j) == 0) {					\
+					khkey_t key = h->keys[j];							\
+					khval_t val;										\
+					khint_t new_mask;									\
+					new_mask = new_n_buckets - 1; 						\
+					if (kh_is_map) val = h->vals[j];					\
+					__ac_set_isdel_true(h->flags, j);					\
+					while (1) { /* kick-out process; sort of like in Cuckoo hashing */ \
+						khint_t k, i, step = 0; \
+						k = __hash_func(key);							\
+						i = k & new_mask;								\
+						while (!__ac_isempty(new_flags, i)) i = (i + (++step)) & new_mask; \
+						__ac_set_isempty_false(new_flags, i);			\
+						if (i < h->n_buckets && __ac_iseither(h->flags, i) == 0) { /* kick out the existing element */ \
+							{ khkey_t tmp = h->keys[i]; h->keys[i] = key; key = tmp; } \
+							if (kh_is_map) { khval_t tmp = h->vals[i]; h->vals[i] = val; val = tmp; } \
+							__ac_set_isdel_true(h->flags, i); /* mark it as deleted in the old hash table */ \
+						} else { /* write the element and jump out of the loop */ \
+							h->keys[i] = key;							\
+							if (kh_is_map) h->vals[i] = val;			\
+							break;										\
+						}												\
+					}													\
+				}														\
+			}															\
+			if (h->n_buckets > new_n_buckets) { /* shrink the hash table */ \
+				h->keys = (khkey_t*)krealloc((void *)h->keys, new_n_buckets * sizeof(khkey_t)); \
+				if (kh_is_map) h->vals = (khval_t*)krealloc((void *)h->vals, new_n_buckets * sizeof(khval_t)); \
+			}															\
+			kfree(h->flags); /* free the working space */				\
+			h->flags = new_flags;										\
+			h->n_buckets = new_n_buckets;								\
+			h->n_occupied = h->size;									\
+			h->upper_bound = (khint_t)(h->n_buckets * __ac_HASH_UPPER + 0.5); \
+		}																\
+		return 0;														\
+	}																	\
+	SCOPE khint_t kh_put_##name(kh_##name##_t *h, khkey_t key, int *ret) \
+	{																	\
+		khint_t x;														\
+		if (h->n_occupied >= h->upper_bound) { /* update the hash table */ \
+			if (h->n_buckets > (h->size<<1)) {							\
+				if (kh_resize_##name(h, h->n_buckets - 1) < 0) { /* clear "deleted" elements */ \
+					*ret = -1; return h->n_buckets;						\
+				}														\
+			} else if (kh_resize_##name(h, h->n_buckets + 1) < 0) { /* expand the hash table */ \
+				*ret = -1; return h->n_buckets;							\
+			}															\
+		} /* TODO: to implement automatically shrinking; resize() already support shrinking */ \
+		{																\
+			khint_t k, i, site, last, mask = h->n_buckets - 1, step = 0; \
+			x = site = h->n_buckets; k = __hash_func(key); i = k & mask; \
+			if (__ac_isempty(h->flags, i)) x = i; /* for speed up */	\
+			else {														\
+				last = i; \
+				while (!__ac_isempty(h->flags, i) && (__ac_isdel(h->flags, i) || !__hash_equal(h->keys[i], key))) { \
+					if (__ac_isdel(h->flags, i)) site = i;				\
+					i = (i + (++step)) & mask; \
+					if (i == last) { x = site; break; }					\
+				}														\
+				if (x == h->n_buckets) {								\
+					if (__ac_isempty(h->flags, i) && site != h->n_buckets) x = site; \
+					else x = i;											\
+				}														\
+			}															\
+		}																\
+		if (__ac_isempty(h->flags, x)) { /* not present at all */		\
+			h->keys[x] = key;											\
+			__ac_set_isboth_false(h->flags, x);							\
+			++h->size; ++h->n_occupied;									\
+			*ret = 1;													\
+		} else if (__ac_isdel(h->flags, x)) { /* deleted */				\
+			h->keys[x] = key;											\
+			__ac_set_isboth_false(h->flags, x);							\
+			++h->size;													\
+			*ret = 2;													\
+		} else *ret = 0; /* Don't touch h->keys[x] if present and not deleted */ \
+		return x;														\
+	}																	\
+	SCOPE void kh_del_##name(kh_##name##_t *h, khint_t x)				\
+	{																	\
+		if (x != h->n_buckets && !__ac_iseither(h->flags, x)) {			\
+			__ac_set_isdel_true(h->flags, x);							\
+			--h->size;													\
+		}																\
+	}
+
+#define KHASH_DECLARE(name, khkey_t, khval_t)		 					\
+	__KHASH_TYPE(name, khkey_t, khval_t) 								\
+	__KHASH_PROTOTYPES(name, khkey_t, khval_t)
+
+#define KHASH_INIT2(name, SCOPE, khkey_t, khval_t, kh_is_map, __hash_func, __hash_equal) \
+	__KHASH_TYPE(name, khkey_t, khval_t) 								\
+	__KHASH_IMPL(name, SCOPE, khkey_t, khval_t, kh_is_map, __hash_func, __hash_equal)
+
+#define KHASH_INIT(name, khkey_t, khval_t, kh_is_map, __hash_func, __hash_equal) \
+	KHASH_INIT2(name, static kh_inline klib_unused, khkey_t, khval_t, kh_is_map, __hash_func, __hash_equal)
+
+/* --- BEGIN OF HASH FUNCTIONS --- */
+
+/*! @function
+  @abstract     Integer hash function
+  @param  key   The integer [khint32_t]
+  @return       The hash value [khint_t]
+ */
+#define kh_int_hash_func(key) (khint32_t)(key)
+/*! @function
+  @abstract     Integer comparison function
+ */
+#define kh_int_hash_equal(a, b) ((a) == (b))
+/*! @function
+  @abstract     64-bit integer hash function
+  @param  key   The integer [khint64_t]
+  @return       The hash value [khint_t]
+ */
+#define kh_int64_hash_func(key) (khint32_t)((key)>>33^(key)^(key)<<11)
+/*! @function
+  @abstract     64-bit integer comparison function
+ */
+#define kh_int64_hash_equal(a, b) ((a) == (b))
+/*! @function
+  @abstract     const char* hash function
+  @param  s     Pointer to a null terminated string
+  @return       The hash value
+ */
+static kh_inline khint_t __ac_X31_hash_string(const char *s)
+{
+	khint_t h = (khint_t)*s;
+	if (h) for (++s ; *s; ++s) h = (h << 5) - h + (khint_t)*s;
+	return h;
+}
+/*! @function
+  @abstract     Another interface to const char* hash function
+  @param  key   Pointer to a null terminated string [const char*]
+  @return       The hash value [khint_t]
+ */
+#define kh_str_hash_func(key) __ac_X31_hash_string(key)
+/*! @function
+  @abstract     Const char* comparison function
+ */
+#define kh_str_hash_equal(a, b) (strcmp(a, b) == 0)
+
+static kh_inline khint_t __ac_Wang_hash(khint_t key)
+{
+    key += ~(key << 15);
+    key ^=  (key >> 10);
+    key +=  (key << 3);
+    key ^=  (key >> 6);
+    key += ~(key << 11);
+    key ^=  (key >> 16);
+    return key;
+}
+#define kh_int_hash_func2(key) __ac_Wang_hash((khint_t)key)
+
+/* --- END OF HASH FUNCTIONS --- */
+
+/* Other convenient macros... */
+
+/*!
+  @abstract Type of the hash table.
+  @param  name  Name of the hash table [symbol]
+ */
+#define khash_t(name) kh_##name##_t
+
+/*! @function
+  @abstract     Initiate a hash table.
+  @param  name  Name of the hash table [symbol]
+  @return       Pointer to the hash table [khash_t(name)*]
+ */
+#define kh_init(name) kh_init_##name()
+
+/*! @function
+  @abstract     Destroy a hash table.
+  @param  name  Name of the hash table [symbol]
+  @param  h     Pointer to the hash table [khash_t(name)*]
+ */
+#define kh_destroy(name, h) kh_destroy_##name(h)
+
+/*! @function
+  @abstract     Reset a hash table without deallocating memory.
+  @param  name  Name of the hash table [symbol]
+  @param  h     Pointer to the hash table [khash_t(name)*]
+ */
+#define kh_clear(name, h) kh_clear_##name(h)
+
+/*! @function
+  @abstract     Resize a hash table.
+  @param  name  Name of the hash table [symbol]
+  @param  h     Pointer to the hash table [khash_t(name)*]
+  @param  s     New size [khint_t]
+ */
+#define kh_resize(name, h, s) kh_resize_##name(h, s)
+
+/*! @function
+  @abstract     Insert a key to the hash table.
+  @param  name  Name of the hash table [symbol]
+  @param  h     Pointer to the hash table [khash_t(name)*]
+  @param  k     Key [type of keys]
+  @param  r     Extra return code: -1 if the operation failed;
+                0 if the key is present in the hash table;
+                1 if the bucket is empty (never used); 2 if the element in
+				the bucket has been deleted [int*]
+  @return       Iterator to the inserted element [khint_t]
+ */
+#define kh_put(name, h, k, r) kh_put_##name(h, k, r)
+
+/*! @function
+  @abstract     Retrieve a key from the hash table.
+  @param  name  Name of the hash table [symbol]
+  @param  h     Pointer to the hash table [khash_t(name)*]
+  @param  k     Key [type of keys]
+  @return       Iterator to the found element, or kh_end(h) if the element is absent [khint_t]
+ */
+#define kh_get(name, h, k) kh_get_##name(h, k)
+
+/*! @function
+  @abstract     Remove a key from the hash table.
+  @param  name  Name of the hash table [symbol]
+  @param  h     Pointer to the hash table [khash_t(name)*]
+  @param  k     Iterator to the element to be deleted [khint_t]
+ */
+#define kh_del(name, h, k) kh_del_##name(h, k)
+
+/*! @function
+  @abstract     Test whether a bucket contains data.
+  @param  h     Pointer to the hash table [khash_t(name)*]
+  @param  x     Iterator to the bucket [khint_t]
+  @return       1 if containing data; 0 otherwise [int]
+ */
+#define kh_exist(h, x) (!__ac_iseither((h)->flags, (x)))
+
+/*! @function
+  @abstract     Get key given an iterator
+  @param  h     Pointer to the hash table [khash_t(name)*]
+  @param  x     Iterator to the bucket [khint_t]
+  @return       Key [type of keys]
+ */
+#define kh_key(h, x) ((h)->keys[x])
+
+/*! @function
+  @abstract     Get value given an iterator
+  @param  h     Pointer to the hash table [khash_t(name)*]
+  @param  x     Iterator to the bucket [khint_t]
+  @return       Value [type of values]
+  @discussion   For hash sets, calling this results in segfault.
+ */
+#define kh_val(h, x) ((h)->vals[x])
+
+/*! @function
+  @abstract     Alias of kh_val()
+ */
+#define kh_value(h, x) ((h)->vals[x])
+
+/*! @function
+  @abstract     Get the start iterator
+  @param  h     Pointer to the hash table [khash_t(name)*]
+  @return       The start iterator [khint_t]
+ */
+#define kh_begin(h) (khint_t)(0)
+
+/*! @function
+  @abstract     Get the end iterator
+  @param  h     Pointer to the hash table [khash_t(name)*]
+  @return       The end iterator [khint_t]
+ */
+#define kh_end(h) ((h)->n_buckets)
+
+/*! @function
+  @abstract     Get the number of elements in the hash table
+  @param  h     Pointer to the hash table [khash_t(name)*]
+  @return       Number of elements in the hash table [khint_t]
+ */
+#define kh_size(h) ((h)->size)
+
+/*! @function
+  @abstract     Get the number of buckets in the hash table
+  @param  h     Pointer to the hash table [khash_t(name)*]
+  @return       Number of buckets in the hash table [khint_t]
+ */
+#define kh_n_buckets(h) ((h)->n_buckets)
+
+/*! @function
+  @abstract     Iterate over the entries in the hash table
+  @param  h     Pointer to the hash table [khash_t(name)*]
+  @param  kvar  Variable to which key will be assigned
+  @param  vvar  Variable to which value will be assigned
+  @param  code  Block of code to execute
+ */
+#define kh_foreach(h, kvar, vvar, code) { khint_t __i;		\
+	for (__i = kh_begin(h); __i != kh_end(h); ++__i) {		\
+		if (!kh_exist(h,__i)) continue;						\
+		(kvar) = kh_key(h,__i);								\
+		(vvar) = kh_val(h,__i);								\
+		code;												\
+	} }
+
+/*! @function
+  @abstract     Iterate over the values in the hash table
+  @param  h     Pointer to the hash table [khash_t(name)*]
+  @param  vvar  Variable to which value will be assigned
+  @param  code  Block of code to execute
+ */
+#define kh_foreach_value(h, vvar, code) { khint_t __i;		\
+	for (__i = kh_begin(h); __i != kh_end(h); ++__i) {		\
+		if (!kh_exist(h,__i)) continue;						\
+		(vvar) = kh_val(h,__i);								\
+		code;												\
+	} }
+
+/* More convenient interfaces */
+
+/*! @function
+  @abstract     Instantiate a hash set containing integer keys
+  @param  name  Name of the hash table [symbol]
+ */
+#define KHASH_SET_INIT_INT(name)										\
+	KHASH_INIT(name, khint32_t, char, 0, kh_int_hash_func, kh_int_hash_equal)
+
+/*! @function
+  @abstract     Instantiate a hash map containing integer keys
+  @param  name  Name of the hash table [symbol]
+  @param  khval_t  Type of values [type]
+ */
+#define KHASH_MAP_INIT_INT(name, khval_t)								\
+	KHASH_INIT(name, khint32_t, khval_t, 1, kh_int_hash_func, kh_int_hash_equal)
+
+/*! @function
+  @abstract     Instantiate a hash set containing 64-bit integer keys
+  @param  name  Name of the hash table [symbol]
+ */
+#define KHASH_SET_INIT_INT64(name)										\
+	KHASH_INIT(name, khint64_t, char, 0, kh_int64_hash_func, kh_int64_hash_equal)
+
+/*! @function
+  @abstract     Instantiate a hash map containing 64-bit integer keys
+  @param  name  Name of the hash table [symbol]
+  @param  khval_t  Type of values [type]
+ */
+#define KHASH_MAP_INIT_INT64(name, khval_t)								\
+	KHASH_INIT(name, khint64_t, khval_t, 1, kh_int64_hash_func, kh_int64_hash_equal)
+
+typedef const char *kh_cstr_t;
+/*! @function
+  @abstract     Instantiate a hash map containing const char* keys
+  @param  name  Name of the hash table [symbol]
+ */
+#define KHASH_SET_INIT_STR(name)										\
+	KHASH_INIT(name, kh_cstr_t, char, 0, kh_str_hash_func, kh_str_hash_equal)
+
+/*! @function
+  @abstract     Instantiate a hash map containing const char* keys
+  @param  name  Name of the hash table [symbol]
+  @param  khval_t  Type of values [type]
+ */
+#define KHASH_MAP_INIT_STR(name, khval_t)								\
+	KHASH_INIT(name, kh_cstr_t, khval_t, 1, kh_str_hash_func, kh_str_hash_equal)
+
+#endif /* __AC_KHASH_H */

include/nets/net_node.h

@@ -0,0 +1,29 @@
+#ifndef NET_NODE_H
+#define NET_NODE_H
+
+#ifndef _WIN32
+// POSIX
+#include <tcpd/tcpconnection.h>
+#include <tcpd/tcpserver.h>
+#endif
+
+#include <dynarr.h>
+#include <stdlib.h>
+#include <stdint.h>
+#include <stdio.h>
+#include <constants.h>
+
+typedef struct {
+    tcp_server_t* server;
+    // TODO: Add the list of clients as well
+} net_node_t;
+
+net_node_t* Node_Create();
+void Node_Destroy(net_node_t* node);
+
+// Callback logic
+void Node_Server_OnConnect(tcp_connection_t* client);
+void Node_Server_OnData(tcp_connection_t* client);
+void Node_Server_OnDisconnect(tcp_connection_t* client);
+
+#endif

include/packettype.h

@@ -3,16 +3,7 @@
 
 typedef enum {
     PACKET_TYPE_NONE = 0,
-    PACKET_TYPE_HELLO = 1,
+    // Add more here
-    PACKET_TYPE_TASK_ASSIGN = 2,
-    PACKET_TYPE_TASK_RESULT = 3,
-    PACKET_TYPE_STATUS_UPDATE = 4,
-    PACKET_TYPE_CLIENT_CAPABILITIES = 5,
-    PACKET_TYPE_TASK_REQUEST = 6,
-    PACKET_TYPE_MISSING_INFO = 7,
-    PACKET_TYPE_ACKNOWLEDGE = 8,
-    PACKET_TYPE_TASK_REJECT = 9,
-    PACKET_TYPE_TASK_NONE_AVAILABLE = 10
 } PacketType;
 
 #endif

include/randomx/librx_wrapper.h

@@ -1,21 +0,0 @@
-#ifndef LIBRX_WRAPPER_H
-#define LIBRX_WRAPPER_H
-
-#include <stddef.h>
-#include <stdint.h>
-#include <randomx.h>
-#include <stdbool.h>
-
-#ifdef __cplusplus
-extern "C" {
-#endif
-
-bool RandomX_Init(const char* key, bool preferFullMemory);
-void RandomX_Destroy();
-void RandomX_CalculateHash(const uint8_t* input, size_t inputLen, uint8_t* output);
-
-#ifdef __cplusplus
-}
-#endif
-
-#endif

include/storage/block_table.h

@@ -0,0 +1,13 @@
+#ifndef BLOCK_TABLE_H
+#define BLOCK_TABLE_H
+
+#include <stdint.h>
+#include <stdlib.h>
+
+typedef struct {
+    uint64_t blockNumber;
+    uint64_t byteNumber;
+    uint64_t blockSize;
+} block_table_entry_t;
+
+#endif

include/tcpd/tcpconnection.h

@@ -11,19 +11,19 @@
 
 #define MTU 1500
 
-struct TcpClient {
+struct tcp_connection_t {
     int clientFd;
     struct sockaddr_in clientAddr;
     uint32_t clientId;
 
     unsigned char dataBuf[MTU];
     ssize_t dataBufLen;
-    void (*on_data)(struct TcpClient* client);
+    void (*on_data)(struct tcp_connection_t* client);
-    void (*on_disconnect)(struct TcpClient* client);
+    void (*on_disconnect)(struct tcp_connection_t* client);
 
     pthread_t clientThread;
 };
 
-typedef struct TcpClient TcpClient;
+typedef struct tcp_connection_t tcp_connection_t;
 
 #endif

include/tcpd/tcpserver.h

@@ -10,7 +10,7 @@
 #include <pthread.h>
 #include <stdint.h>
 
-#include <tcpd/tcpclient.h>
+#include <tcpd/tcpconnection.h>
 #include <numgen.h>
 #include <dynarr.h>
 
@@ -20,37 +20,37 @@ typedef struct {
     int opt;
 
     // Called before the client thread runs
-    void (*on_connect)(TcpClient* client);
+    void (*on_connect)(tcp_connection_t* client);
     // Called when data is received
-    void (*on_data)(TcpClient* client);
+    void (*on_data)(tcp_connection_t* client);
     // Called before the socket and client thread are killed; Do NOT free client manually
-    void (*on_disconnect)(TcpClient* client);
+    void (*on_disconnect)(tcp_connection_t* client);
 
     // max clients
     size_t clients;
-    TcpClient** clientsArrPtr;
+    tcp_connection_t** clientsArrPtr;
 
     pthread_t svrThread;
-} TcpServer;
+} tcp_server_t;
 
 struct tcpclient_thread_args {
-    TcpClient* clientPtr;
+    tcp_connection_t* clientPtr;
-    TcpServer* serverPtr;
+    tcp_server_t* serverPtr;
 };
 
 typedef struct tcpclient_thread_args tcpclient_thread_args;
 
-TcpServer* TcpServer_Create();
+tcp_server_t* TcpServer_Create();
-void TcpServer_Destroy(TcpServer* ptr);
+void TcpServer_Destroy(tcp_server_t* ptr);
 
-void TcpServer_Init(TcpServer* ptr, unsigned short port, const char* addr);
+void TcpServer_Init(tcp_server_t* ptr, unsigned short port, const char* addr);
-void TcpServer_Start(TcpServer* ptr, int maxcons);
+void TcpServer_Start(tcp_server_t* ptr, int maxcons);
-void TcpServer_Stop(TcpServer* ptr);
+void TcpServer_Stop(tcp_server_t* ptr);
-void TcpServer_Send(TcpServer* ptr, TcpClient* cli, void* data, size_t len);
+void TcpServer_Send(tcp_server_t* ptr, tcp_connection_t* cli, void* data, size_t len);
 void Generic_SendSocket(int sock, void* data, size_t len);
-void TcpServer_Disconnect(TcpServer* ptr, TcpClient* cli);
+void TcpServer_Disconnect(tcp_server_t* ptr, tcp_connection_t* cli);
-void TcpServer_KillClient(TcpServer* ptr, TcpClient* cli);
+void TcpServer_KillClient(tcp_server_t* ptr, tcp_connection_t* cli);
 
-size_t Generic_FindClientInArrayByPtr(TcpClient** arr, TcpClient* ptr, size_t len);
+size_t Generic_FindClientInArrayByPtr(tcp_connection_t** arr, tcp_connection_t* ptr, size_t len);
 
 #endif

include/uint256.h

@@ -55,4 +55,94 @@ static inline bool uint256_add(uint256_t* a, const uint256_t* b) {
     return carry > 0;
 }
 
+static inline bool uint256_subtract_u64(uint256_t* balance, uint64_t amount) {
+    if (!balance) {
+        return false;
+    }
+
+    if (balance->limbs[0] >= amount) {
+        balance->limbs[0] -= amount;
+        return false;
+    }
+
+    uint64_t borrow = amount - balance->limbs[0];
+    balance->limbs[0] = UINT64_MAX - borrow + 1ULL;
+
+    for (int i = 1; i < 4; ++i) {
+        if (balance->limbs[i] > 0) {
+            balance->limbs[i]--;
+            return false;
+        }
+
+        balance->limbs[i] = UINT64_MAX;
+    }
+
+    return true; // underflow past 256 bits
+}
+
+static inline bool uint256_subtract(uint256_t* a, const uint256_t* b) {
+    // Check if a < b to prevent underflow
+    for (int i = 3; i >= 0; i--) {
+        if (a->limbs[i] > b->limbs[i]) break;
+        if (a->limbs[i] < b->limbs[i]) return false; // Underflow
+    }
+
+    uint64_t borrow = 0;
+    for (int i = 0; i < 4; i++) {
+        uint64_t old_a = a->limbs[i];
+        a->limbs[i] -= b->limbs[i] + borrow;
+
+        // Detect borrow: if we subtracted more than we had, or we were at zero and had a borrow
+        if (borrow) {
+            borrow = (a->limbs[i] >= old_a);
+        } else {
+            borrow = (a->limbs[i] > old_a);
+        }
+    }
+    return true;
+}
+
+/**
+ * Compares two uint256_t values in a greater-than manner.
+ * Returns [-1, 0, 1] if a > b, a < b, or a == b respectively.
+**/
+static inline int uint256_cmp(const uint256_t* a, const uint256_t* b) {
+    for (int i = 3; i >= 0; i--) {
+        if (a->limbs[i] > b->limbs[i]) return 1;
+        if (a->limbs[i] < b->limbs[i]) return -1;
+    }
+    return 0;
+}
+
+static inline void uint256_serialize(const uint256_t* value, char* out) {
+    if (!value || !out) {
+        return;
+    }
+
+    // Convert into string of decimal digits for easier readability; max 78 digits for 256 bits
+    char digits[80];
+    size_t digitCount = 0;
+    uint256_t tmp = *value;
+    while (tmp.limbs[0] != 0 || tmp.limbs[1] != 0 || tmp.limbs[2] != 0 || tmp.limbs[3] != 0) {
+        uint64_t remainder = 0;
+        for (int i = 3; i >= 0; --i) {
+            __uint128_t cur = ((__uint128_t)remainder << 64) | tmp.limbs[i];
+            tmp.limbs[i] = (uint64_t)(cur / 10u);
+            remainder = (uint64_t)(cur % 10u);
+        }
+
+        if (digitCount < sizeof(digits) - 1) {
+            digits[digitCount++] = (char)('0' + remainder);
+        } else {
+            break;
+        }
+    }
+    digits[digitCount] = '\0';
+
+    for (size_t i = 0; i < digitCount; ++i) {
+        out[i] = digits[digitCount - 1 - i];
+    }
+    out[digitCount] = '\0';
+}
+
 #endif

src/autolykos2/autolykos2.c

@@ -0,0 +1,472 @@
+#include <autolykos2/autolykos2.h>
+
+#include "../../include/blake2/blake2.h"
+
+#include <stdlib.h>
+#include <string.h>
+
+typedef struct {
+    uint8_t* buf;
+    size_t cap;
+    size_t len;
+} dag_buffer_t;
+
+struct Autolykos2Context {
+    dag_buffer_t dag;
+    void* backend;
+};
+
+#ifdef SKALACOIN_AUTOLYKOS2_REF_AVAILABLE
+extern void* skalacoin_autolykos2_ref_create(void);
+extern void skalacoin_autolykos2_ref_destroy(void* handle);
+extern bool skalacoin_autolykos2_ref_check_target(
+    void* handle,
+    const uint8_t message32[32],
+    uint64_t nonce,
+    uint32_t height,
+    const uint8_t target32[32]
+);
+#endif
+
+static bool Autolykos2_FallbackHash(
+    const uint8_t seed32[32],
+    const uint8_t* message,
+    size_t messageLen,
+    uint64_t nonce,
+    uint64_t height,
+    uint8_t outHash[32]
+) {
+    if (!seed32 || !outHash) {
+        return false;
+    }
+
+    uint8_t nonceBytes[8];
+    uint8_t heightBytes[8];
+    memcpy(nonceBytes, &nonce, sizeof(nonceBytes));
+    memcpy(heightBytes, &height, sizeof(heightBytes));
+
+    const size_t totalLen = 32 + messageLen + sizeof(nonceBytes) + sizeof(heightBytes);
+    uint8_t* material = (uint8_t*)malloc(totalLen == 0 ? 1 : totalLen);
+    if (!material) {
+        return false;
+    }
+
+    size_t off = 0;
+    memcpy(material + off, seed32, 32);
+    off += 32;
+    if (messageLen > 0) {
+        memcpy(material + off, message, messageLen);
+        off += messageLen;
+    }
+    memcpy(material + off, nonceBytes, sizeof(nonceBytes));
+    off += sizeof(nonceBytes);
+    memcpy(material + off, heightBytes, sizeof(heightBytes));
+
+    const bool ok = Blake2b_Hash(material, totalLen, outHash, 32);
+    free(material);
+    return ok;
+}
+
+static int Cmp256BE(const uint8_t a[32], const uint8_t b[32]) {
+    for (size_t i = 0; i < 32; ++i) {
+        if (a[i] < b[i]) return -1;
+        if (a[i] > b[i]) return 1;
+    }
+    return 0;
+}
+
+static void WriteU64LE(uint64_t v, uint8_t out[8]) {
+    out[0] = (uint8_t)(v & 0xffu);
+    out[1] = (uint8_t)((v >> 8) & 0xffu);
+    out[2] = (uint8_t)((v >> 16) & 0xffu);
+    out[3] = (uint8_t)((v >> 24) & 0xffu);
+    out[4] = (uint8_t)((v >> 32) & 0xffu);
+    out[5] = (uint8_t)((v >> 40) & 0xffu);
+    out[6] = (uint8_t)((v >> 48) & 0xffu);
+    out[7] = (uint8_t)((v >> 56) & 0xffu);
+}
+
+static void WriteU32LE(uint32_t v, uint8_t out[4]) {
+    out[0] = (uint8_t)(v & 0xffu);
+    out[1] = (uint8_t)((v >> 8) & 0xffu);
+    out[2] = (uint8_t)((v >> 16) & 0xffu);
+    out[3] = (uint8_t)((v >> 24) & 0xffu);
+}
+
+static bool DeriveSeedFromMessage(const uint8_t* message, size_t messageLen, uint8_t outSeed[32]) {
+    if (!message || !outSeed) {
+        return false;
+    }
+
+    return Blake2b_Hash(message, messageLen, outSeed, 32);
+}
+
+static bool ComputeLaneIndex(
+    const uint8_t seed32[32],
+    uint64_t nonce,
+    uint64_t height,
+    uint32_t round,
+    uint32_t laneCount,
+    uint32_t* outLane
+) {
+    if (!seed32 || !outLane || laneCount == 0) {
+        return false;
+    }
+
+    uint8_t input[32 + 8 + 8 + 4];
+    uint8_t digest[32];
+    uint8_t nonceBytes[8];
+    uint8_t heightBytes[8];
+    uint8_t roundBytes[4];
+
+    WriteU64LE(nonce, nonceBytes);
+    WriteU64LE(height, heightBytes);
+    WriteU32LE(round, roundBytes);
+
+    memcpy(input, seed32, 32);
+    memcpy(input + 32, nonceBytes, sizeof(nonceBytes));
+    memcpy(input + 40, heightBytes, sizeof(heightBytes));
+    memcpy(input + 48, roundBytes, sizeof(roundBytes));
+
+    if (!Blake2b_Hash(input, sizeof(input), digest, sizeof(digest))) {
+        return false;
+    }
+
+    uint32_t raw =
+        ((uint32_t)digest[0]) |
+        ((uint32_t)digest[1] << 8) |
+        ((uint32_t)digest[2] << 16) |
+        ((uint32_t)digest[3] << 24);
+    *outLane = raw % laneCount;
+    return true;
+}
+
+static bool ReadDagLaneFromContext(const Autolykos2Context* ctx, uint32_t laneIndex, uint8_t outLane[32]) {
+    if (!ctx || !ctx->dag.buf || !outLane) {
+        return false;
+    }
+
+    const size_t offset = (size_t)laneIndex * 32u;
+    if (ctx->dag.len < offset + 32u) {
+        return false;
+    }
+
+    memcpy(outLane, ctx->dag.buf + offset, 32);
+    return true;
+}
+
+static bool ReadDagLaneFromSeed(const uint8_t seed32[32], uint32_t laneIndex, uint8_t outLane[32]) {
+    if (!seed32 || !outLane) {
+        return false;
+    }
+
+    const uint64_t counter = (uint64_t)laneIndex / 2u;
+    const bool upperHalf = (laneIndex & 1u) != 0u;
+    uint8_t input[32 + 8];
+    uint8_t digest[64];
+    uint8_t counterBytes[8];
+
+    WriteU64LE(counter, counterBytes);
+    memcpy(input, seed32, 32);
+    memcpy(input + 32, counterBytes, sizeof(counterBytes));
+
+    if (!Blake2b_Hash(input, sizeof(input), digest, sizeof(digest))) {
+        return false;
+    }
+
+    memcpy(outLane, digest + (upperHalf ? 32 : 0), 32);
+    return true;
+}
+
+static bool Autolykos2_HashCore(
+    const uint8_t seed32[32],
+    const uint8_t* message,
+    size_t messageLen,
+    uint64_t nonce,
+    uint64_t height,
+    uint32_t laneCount,
+    const Autolykos2Context* ctx,
+    bool useContextDag,
+    uint8_t outHash[32]
+) {
+    if (!seed32 || !message || !outHash || laneCount == 0) {
+        return false;
+    }
+
+    uint8_t acc[32];
+    memset(acc, 0, sizeof(acc));
+
+    for (uint32_t round = 0; round < 32; ++round) {
+        uint32_t laneIndex = 0;
+        uint8_t lane[32];
+
+        if (!ComputeLaneIndex(seed32, nonce, height, round, laneCount, &laneIndex)) {
+            return false;
+        }
+
+        if (useContextDag) {
+            if (!ReadDagLaneFromContext(ctx, laneIndex, lane)) {
+                return false;
+            }
+        } else {
+            if (!ReadDagLaneFromSeed(seed32, laneIndex, lane)) {
+                return false;
+            }
+        }
+
+        for (size_t i = 0; i < 32; ++i) {
+            acc[i] ^= lane[i];
+        }
+    }
+
+    uint8_t baseHash[32];
+    uint8_t accHash[32];
+    if (!Autolykos2_FallbackHash(seed32, message, messageLen, nonce, height, baseHash)) {
+        return false;
+    }
+    if (!Blake2b_Hash(acc, sizeof(acc), accHash, sizeof(accHash))) {
+        return false;
+    }
+
+    uint8_t finalInput[32 + 32 + 8 + 8];
+    uint8_t nonceBytes[8];
+    uint8_t heightBytes[8];
+    WriteU64LE(nonce, nonceBytes);
+    WriteU64LE(height, heightBytes);
+
+    memcpy(finalInput, baseHash, 32);
+    memcpy(finalInput + 32, accHash, 32);
+    memcpy(finalInput + 64, nonceBytes, 8);
+    memcpy(finalInput + 72, heightBytes, 8);
+    return Blake2b_Hash(finalInput, sizeof(finalInput), outHash, 32);
+}
+
+Autolykos2Context* Autolykos2_Create(void) {
+    Autolykos2Context* ctx = (Autolykos2Context*)calloc(1, sizeof(Autolykos2Context));
+    if (!ctx) {
+        return NULL;
+    }
+
+#ifdef SKALACOIN_AUTOLYKOS2_REF_AVAILABLE
+    ctx->backend = skalacoin_autolykos2_ref_create();
+#endif
+
+    return ctx;
+}
+
+void Autolykos2_Destroy(Autolykos2Context* ctx) {
+    if (!ctx) {
+        return;
+    }
+
+#ifdef SKALACOIN_AUTOLYKOS2_REF_AVAILABLE
+    if (ctx->backend) {
+        skalacoin_autolykos2_ref_destroy(ctx->backend);
+        ctx->backend = NULL;
+    }
+#endif
+
+    free(ctx->dag.buf);
+    free(ctx);
+}
+
+bool Autolykos2_DagAllocate(Autolykos2Context* ctx, size_t bytes) {
+    if (!ctx) {
+        return false;
+    }
+
+    uint8_t* newBuf = (uint8_t*)realloc(ctx->dag.buf, bytes == 0 ? 1 : bytes);
+    if (!newBuf) {
+        return false;
+    }
+
+    ctx->dag.buf = newBuf;
+    ctx->dag.cap = bytes;
+    if (ctx->dag.len > bytes) {
+        ctx->dag.len = bytes;
+    }
+    if (bytes > 0) {
+        memset(ctx->dag.buf, 0, bytes);
+    }
+    return true;
+}
+
+bool Autolykos2_DagAppend(Autolykos2Context* ctx, const uint8_t* data, size_t len) {
+    if (!ctx || !data || len == 0) {
+        return false;
+    }
+
+    if (ctx->dag.len + len > ctx->dag.cap) {
+        return false;
+    }
+
+    memcpy(ctx->dag.buf + ctx->dag.len, data, len);
+    ctx->dag.len += len;
+    return true;
+}
+
+bool Autolykos2_DagGenerate(Autolykos2Context* ctx, const uint8_t seed32[32]) {
+    if (!ctx || !seed32 || !ctx->dag.buf || ctx->dag.cap == 0) {
+        return false;
+    }
+
+    uint8_t input[32 + 8];
+    uint8_t digest[64];
+    size_t offset = 0;
+    uint64_t counter = 0;
+
+    while (offset < ctx->dag.cap) {
+        WriteU64LE(counter, input + 32);
+        memcpy(input, seed32, 32);
+
+        if (!Blake2b_Hash(input, sizeof(input), digest, sizeof(digest))) {
+            return false;
+        }
+
+        size_t chunk = ctx->dag.cap - offset;
+        if (chunk > sizeof(digest)) {
+            chunk = sizeof(digest);
+        }
+
+        memcpy(ctx->dag.buf + offset, digest, chunk);
+        offset += chunk;
+        ++counter;
+    }
+
+    ctx->dag.len = ctx->dag.cap;
+    return true;
+}
+
+void Autolykos2_DagClear(Autolykos2Context* ctx) {
+    if (!ctx || !ctx->dag.buf) {
+        return;
+    }
+    memset(ctx->dag.buf, 0, ctx->dag.cap);
+    ctx->dag.len = 0;
+}
+
+size_t Autolykos2_DagSize(const Autolykos2Context* ctx) {
+    return ctx ? ctx->dag.len : 0;
+}
+
+bool Autolykos2_Hash(
+    Autolykos2Context* ctx,
+    const uint8_t* message,
+    size_t messageLen,
+    uint64_t nonce,
+    uint64_t height,
+    uint8_t outHash[32]
+) {
+    if (!ctx || !message || !outHash) {
+        return false;
+    }
+
+    if (!ctx->dag.buf || ctx->dag.len < 32 || (ctx->dag.len % 32) != 0) {
+        return false;
+    }
+
+    uint8_t seed32[32];
+    if (!DeriveSeedFromMessage(message, messageLen, seed32)) {
+        return false;
+    }
+
+    const size_t laneCount64 = ctx->dag.len / 32u;
+    if (laneCount64 == 0 || laneCount64 > UINT32_MAX) {
+        return false;
+    }
+
+    return Autolykos2_HashCore(
+        seed32,
+        message,
+        messageLen,
+        nonce,
+        height,
+        (uint32_t)laneCount64,
+        ctx,
+        true,
+        outHash
+    );
+}
+
+bool Autolykos2_LightHash(const uint8_t* seed, blockchain_t* chain, uint64_t nonce, uint8_t* out) {
+    if (!seed || !chain || !out) {
+        return false;
+    }
+
+    const uint64_t height = (uint64_t)Chain_Size(chain);
+    const size_t dagBytes = CalculateTargetDAGSize(chain);
+    if (dagBytes < 32 || (dagBytes % 32) != 0) {
+        return false;
+    }
+
+    const size_t laneCount64 = dagBytes / 32u;
+    if (laneCount64 == 0 || laneCount64 > UINT32_MAX) {
+        return false;
+    }
+
+    // Light path derives the needed DAG lanes from seed on-demand, no large DAG allocation required.
+    return Autolykos2_HashCore(
+        seed,
+        seed,
+        32,
+        nonce,
+        height,
+        (uint32_t)laneCount64,
+        NULL,
+        false,
+        out
+    );
+}
+
+bool Autolykos2_CheckTarget(
+    Autolykos2Context* ctx,
+    const uint8_t message32[32],
+    uint64_t nonce,
+    uint64_t height,
+    const uint8_t target32[32],
+    uint8_t outHash[32]
+) {
+    if (!ctx || !message32 || !target32 || !outHash) {
+        return false;
+    }
+
+#ifdef SKALACOIN_AUTOLYKOS2_REF_AVAILABLE
+    if (ctx->backend) {
+        const bool ok = skalacoin_autolykos2_ref_check_target(ctx->backend, message32, nonce, height, target32);
+        if (Autolykos2_Hash(ctx, message32, 32, nonce, height, outHash)) {
+            return ok;
+        }
+        return false;
+    }
+#endif
+
+    if (!Autolykos2_Hash(ctx, message32, 32, nonce, height, outHash)) {
+        return false;
+    }
+    return Cmp256BE(outHash, target32) <= 0;
+}
+
+bool Autolykos2_FindNonceSingleCore(
+    Autolykos2Context* ctx,
+    const uint8_t message32[32],
+    uint64_t height,
+    const uint8_t target32[32],
+    uint64_t startNonce,
+    uint64_t maxIterations,
+    uint64_t* outNonce,
+    uint8_t outHash[32]
+) {
+    if (!ctx || !message32 || !target32 || !outNonce || !outHash) {
+        return false;
+    }
+
+    uint64_t nonce = startNonce;
+    for (uint64_t i = 0; i < maxIterations; ++i, ++nonce) {
+        if (Autolykos2_CheckTarget(ctx, message32, nonce, height, target32, outHash)) {
+            *outNonce = nonce;
+            return true;
+        }
+    }
+
+    return false;
+}

src/autolykos2/autolykos2_ref_wrapper.cpp

@@ -0,0 +1,86 @@
+#include <cstdint>
+#include <cstring>
+
+#include <cpuAutolykos.h>
+#include <definitions.h>
+
+// Reference implementation dependency from request.cc. We provide it locally
+// to avoid pulling the network/request stack.
+uint32_t calcN(uint32_t Hblock) {
+    uint32_t headerHeight = 0;
+    ((uint8_t*)&headerHeight)[0] = ((uint8_t*)&Hblock)[3];
+    ((uint8_t*)&headerHeight)[1] = ((uint8_t*)&Hblock)[2];
+    ((uint8_t*)&headerHeight)[2] = ((uint8_t*)&Hblock)[1];
+    ((uint8_t*)&headerHeight)[3] = ((uint8_t*)&Hblock)[0];
+
+    uint32_t newN = INIT_N_LEN;
+    if (headerHeight < IncreaseStart) {
+        newN = INIT_N_LEN;
+    } else if (headerHeight >= IncreaseEnd) {
+        newN = MAX_N_LEN;
+    } else {
+        uint32_t itersNumber = (headerHeight - IncreaseStart) / IncreasePeriodForN + 1;
+        for (uint32_t i = 0; i < itersNumber; i++) {
+            newN = newN / 100 * 105;
+        }
+    }
+
+    return newN;
+}
+
+struct skalacoin_autolykos2_ref_handle {
+    AutolykosAlg* alg;
+};
+
+extern "C" void* skalacoin_autolykos2_ref_create(void) {
+    skalacoin_autolykos2_ref_handle* h = new skalacoin_autolykos2_ref_handle();
+    h->alg = new AutolykosAlg();
+    return h;
+}
+
+extern "C" void skalacoin_autolykos2_ref_destroy(void* handle) {
+    if (!handle) {
+        return;
+    }
+
+    auto* h = static_cast<skalacoin_autolykos2_ref_handle*>(handle);
+    delete h->alg;
+    delete h;
+}
+
+extern "C" bool skalacoin_autolykos2_ref_check_target(
+    void* handle,
+    const uint8_t message32[32],
+    uint64_t nonce,
+    uint32_t height,
+    const uint8_t target32[32]
+) {
+    if (!handle || !message32 || !target32) {
+        return false;
+    }
+
+    auto* h = static_cast<skalacoin_autolykos2_ref_handle*>(handle);
+    if (!h->alg) {
+        return false;
+    }
+
+    uint8_t nonceBytes[8];
+    uint8_t heightBytes[4];
+    std::memcpy(nonceBytes, &nonce, sizeof(nonceBytes));
+
+    // RunAlg expects height bytes; keep deterministic network order.
+    heightBytes[0] = static_cast<uint8_t>((height >> 24) & 0xffu);
+    heightBytes[1] = static_cast<uint8_t>((height >> 16) & 0xffu);
+    heightBytes[2] = static_cast<uint8_t>((height >> 8) & 0xffu);
+    heightBytes[3] = static_cast<uint8_t>(height & 0xffu);
+
+    uint8_t poolBound[32];
+    std::memcpy(poolBound, target32, sizeof(poolBound));
+
+    return h->alg->RunAlg(
+        const_cast<uint8_t*>(message32),
+        nonceBytes,
+        poolBound,
+        heightBytes
+    );
+}

src/autolykos2/easylogging_init.cpp

@@ -0,0 +1,3 @@
+#include <easylogging++.h>
+
+INITIALIZE_EASYLOGGINGPP

src/balance_sheet.c

@@ -0,0 +1,115 @@
+#include <balance_sheet.h>
+
+khash_t(balance_sheet_map_m)* sheetMap = NULL;
+
+void BalanceSheet_Init() {
+    sheetMap = kh_init(balance_sheet_map_m);
+}
+
+int BalanceSheet_Insert(balance_sheet_entry_t entry) {
+    if (!sheetMap) { return -1; }
+
+    // Encapsulate key
+    key32_t key;
+    memcpy(key.bytes, entry.address, 32);
+
+    int ret;
+    khiter_t k = kh_put(balance_sheet_map_m, sheetMap, key, &ret);
+    if (k == kh_end(sheetMap)) {
+        return -1;
+    }
+
+    kh_value(sheetMap, k) = entry;
+
+    return ret;
+}
+
+bool BalanceSheet_Lookup(uint8_t* address, balance_sheet_entry_t* out) {
+    if (!address || !out) { return false; }
+    
+    key32_t key;
+    memcpy(key.bytes, address, 32);
+
+    khiter_t k = kh_get(balance_sheet_map_m, sheetMap, key);
+    if (k != kh_end(sheetMap)) {
+        balance_sheet_entry_t entry = kh_value(sheetMap, k);
+        memcpy(out, &entry, sizeof(balance_sheet_entry_t));
+        return true;
+    }
+
+    return false;
+}
+
+bool BalanceSheet_SaveToFile(const char* outPath) {
+    if (!sheetMap) { return false; }
+
+    char outFile[512];
+    strcpy(outFile, outPath);
+    strcat(outFile, "/balance_sheet.data");
+    FILE* file = fopen(outFile, "wb");
+    if (!file) { return false; }
+
+    khiter_t k;
+    for (k = kh_begin(sheetMap); k != kh_end(sheetMap); ++k) {
+        if (kh_exist(sheetMap, k)) {
+            balance_sheet_entry_t entry = kh_val(sheetMap, k);
+            if (fwrite(&entry, sizeof(balance_sheet_entry_t), 1, file) != 1) {
+                fclose(file);
+                return false;
+            }
+        }
+    }
+
+    fclose(file);
+    return true;
+}
+
+bool BalanceSheet_LoadFromFile(const char* inPath) {
+    if (!sheetMap) { return false; }
+
+    char inFile[512];
+    strcpy(inFile, inPath);
+    strcat(inFile, "/balance_sheet.data");
+    FILE* file = fopen(inFile, "rb");
+    if (!file) { return false; }
+
+    balance_sheet_entry_t entry;
+    while (fread(&entry, sizeof(balance_sheet_entry_t), 1, file) == 1) {
+        if (BalanceSheet_Insert(entry) < 0) {
+            fclose(file);
+            return false;
+        }
+    }
+
+    fclose(file);
+    return true;
+}
+
+void BalanceSheet_Print() {
+    if (!sheetMap) { return; }
+
+    // Iterate through every entry
+    khiter_t k;
+    size_t iter = 0;
+    for (k = kh_begin(sheetMap); k != kh_end(sheetMap); ++k) {
+        if (kh_exist(sheetMap, k)) {
+            key32_t key = kh_key(sheetMap, k);
+            balance_sheet_entry_t val = kh_val(sheetMap, k);
+
+            char balanceStr[80];
+            uint256_serialize(&val.balance, balanceStr);
+
+            printf("Sheet entry %llu: mapkey=%02x%02x%02x%02x... address=%02x%02x%02x%02x... balance=%s\n",
+                (unsigned long long)(iter),
+                key.bytes[0], key.bytes[1], key.bytes[2], key.bytes[3],
+                val.address[0], val.address[1], val.address[2], val.address[3],
+                balanceStr,
+                iter++);
+        }
+    }
+}
+
+void BalanceSheet_Destroy() {
+    kh_destroy(balance_sheet_map_m, sheetMap);
+    sheetMap = NULL;
+}

src/blake2/blake2.c

@@ -0,0 +1,50 @@
+#include <blake2/blake2.h>
+
+#include <openssl/evp.h>
+#include <string.h>
+
+static bool Blake2_HashInternal(
+    const EVP_MD* md,
+    size_t maxDigestLen,
+    const uint8_t* input,
+    size_t inputLen,
+    uint8_t* out,
+    size_t outLen
+) {
+    if (!md || !out || outLen == 0 || outLen > maxDigestLen) {
+        return false;
+    }
+
+    uint8_t digest[EVP_MAX_MD_SIZE];
+    unsigned int digestLen = 0;
+
+    EVP_MD_CTX* ctx = EVP_MD_CTX_new();
+    if (!ctx) {
+        return false;
+    }
+
+    bool ok = EVP_DigestInit_ex(ctx, md, NULL) == 1;
+    if (ok && inputLen > 0) {
+        ok = EVP_DigestUpdate(ctx, input, inputLen) == 1;
+    }
+    if (ok) {
+        ok = EVP_DigestFinal_ex(ctx, digest, &digestLen) == 1;
+    }
+
+    EVP_MD_CTX_free(ctx);
+
+    if (!ok || digestLen < outLen) {
+        return false;
+    }
+
+    memcpy(out, digest, outLen);
+    return true;
+}
+
+bool Blake2b_Hash(const uint8_t* input, size_t inputLen, uint8_t* out, size_t outLen) {
+    return Blake2_HashInternal(EVP_blake2b512(), SKALACOIN_BLAKE2B_OUTBYTES, input, inputLen, out, outLen);
+}
+
+bool Blake2s_Hash(const uint8_t* input, size_t inputLen, uint8_t* out, size_t outLen) {
+    return Blake2_HashInternal(EVP_blake2s256(), SKALACOIN_BLAKE2S_OUTBYTES, input, inputLen, out, outLen);
+}

src/block/block.c

@@ -1,6 +1,46 @@
 #include <block/block.h>
+#include <autolykos2/autolykos2.h>
 #include <stdlib.h>
 
+static Autolykos2Context* g_autolykos2Ctx = NULL;
+
+static Autolykos2Context* GetAutolykos2Ctx(void) {
+    if (!g_autolykos2Ctx) {
+        g_autolykos2Ctx = Autolykos2_Create();
+        if (!g_autolykos2Ctx) {
+            fprintf(stderr, "Failed to create Autolykos2 context\n");
+            exit(1);
+        }
+        Autolykos2_DagAllocate(g_autolykos2Ctx, DAG_BASE_SIZE);
+    }
+    return g_autolykos2Ctx;
+}
+
+void Block_ShutdownPowContext(void) {
+    if (g_autolykos2Ctx) {
+        Autolykos2_Destroy(g_autolykos2Ctx);
+        g_autolykos2Ctx = NULL;
+    }
+}
+
+bool Block_RebuildAutolykos2Dag(size_t dagBytes, const uint8_t seed32[32]) {
+    if (!seed32 || dagBytes == 0) {
+        return false;
+    }
+
+    Autolykos2Context* ctx = GetAutolykos2Ctx();
+    if (!ctx) {
+        return false;
+    }
+
+    Autolykos2_DagClear(ctx);
+    if (!Autolykos2_DagAllocate(ctx, dagBytes)) {
+        return false;
+    }
+
+    return Autolykos2_DagGenerate(ctx, seed32);
+}
+
 block_t* Block_Create() {
     block_t* block = (block_t*)malloc(sizeof(block_t));
     if (!block) {
@@ -12,6 +52,10 @@ block_t* Block_Create() {
         free(block);
         return NULL;
     }
+    
+    // Zero out padding
+    memset(block->header.reserved, 0, sizeof(block->header.reserved));
+
     return block;
 }
 
@@ -116,13 +160,28 @@ void Block_CalculateMerkleRoot(const block_t* block, uint8_t* outHash) {
     DynArr_destroy(hashes2);
 }
 
-void Block_CalculateRandomXHash(const block_t* block, uint8_t* outHash) {
+void Block_CalculateAutolykos2Hash(const block_t* block, uint8_t* outHash) {
     if (!block || !outHash) {
         return;
     }
 
-    // PoW hash is also computed from the header only.
+    // PoW hash is computed from the block header, while canonical block hash remains SHA256.
-    RandomX_CalculateHash((const uint8_t*)&block->header, sizeof(block_header_t), outHash);
+    Autolykos2Context* ctx = GetAutolykos2Ctx();
+    if (!ctx) {
+        memset(outHash, 0, 32);
+        return;
+    }
+
+    if (!Autolykos2_Hash(
+        ctx,
+        (const uint8_t*)&block->header,
+        sizeof(block_header_t),
+        block->header.nonce,
+        (uint32_t)block->header.blockNumber,
+        outHash
+    )) {
+        memset(outHash, 0, 32);
+    }
 }
 
 void Block_AddTransaction(block_t* block, signed_transaction_t* tx) {
@@ -140,7 +199,9 @@ void Block_RemoveTransaction(block_t* block, uint8_t* txHash) {
 
     for (size_t i = 0; i < DynArr_size(block->transactions); i++) {
         signed_transaction_t* currentTx = (signed_transaction_t*)DynArr_at(block->transactions, i);
-        if (memcmp(currentTx->signature.txHash, txHash, 32) == 0) {
+        uint8_t currentTxHash[32];
+        Transaction_CalculateHash(currentTx, currentTxHash);
+        if (memcmp(currentTxHash, txHash, 32) == 0) {
             DynArr_remove(block->transactions, i);
             return;
         }
@@ -199,7 +260,7 @@ bool Block_HasValidProofOfWork(const block_t* block) {
     }
 
     uint8_t hash[32];
-    Block_CalculateRandomXHash(block, hash);
+    Block_CalculateAutolykos2Hash(block, hash);
 
     return Uint256_CompareBE(hash, target) <= 0;
 }
@@ -239,9 +300,9 @@ void Block_Destroy(block_t* block) {
 void Block_Print(const block_t* block) {
     if (!block) return;
 
-    printf("Block #%llu\n", block->header.blockNumber);
+    printf("Block #%llu\n", (unsigned long long)block->header.blockNumber);
-    printf("Timestamp: %llu\n", block->header.timestamp);
+    printf("Timestamp: %llu\n", (unsigned long long)block->header.timestamp);
-    printf("Nonce: %llu\n", block->header.nonce);
+    printf("Nonce: %llu\n", (unsigned long long)block->header.nonce);
     printf("Difficulty Target: 0x%08x\n", block->header.difficultyTarget);
     printf("Version: %u\n", block->header.version);
     printf("Previous Hash: ");
@@ -259,7 +320,14 @@ void Block_Print(const block_t* block) {
         for (size_t i = 0; i < DynArr_size(block->transactions); i++) {
             signed_transaction_t* tx = (signed_transaction_t*)DynArr_at(block->transactions, i);
             if (tx) {
-                printf("  Tx #%zu: %llu -> %llu, fee %llu\n", i, tx->transaction.amount, tx->transaction.fee, tx->transaction.amount + tx->transaction.fee);
+                printf("  Tx #%zu: 1: %llu -> %02x%02x...%02x%02x, fee %llu\n           2: %llu -> %02x%02x...%02x%02x, fee %llu\n", 
+                    i,
+                    (unsigned long long)tx->transaction.amount1,
+                    tx->transaction.recipientAddress1[0], tx->transaction.recipientAddress1[1], tx->transaction.recipientAddress1[30], tx->transaction.recipientAddress1[31],
+                    (unsigned long long)tx->transaction.fee,
+                    (unsigned long long)tx->transaction.amount2,
+                    tx->transaction.recipientAddress2[0], tx->transaction.recipientAddress2[1], tx->transaction.recipientAddress2[30], tx->transaction.recipientAddress2[31],
+                    (unsigned long long)tx->transaction.fee);
             }
         }
     } else {

src/block/chain.c

@@ -1,4 +1,5 @@
 #include <block/chain.h>
+#include <constants.h>
 #include <errno.h>
 #include <sys/stat.h>
 
@@ -32,6 +33,65 @@ static bool BuildPath(char* out, size_t outSize, const char* dirpath, const char
     return written > 0 && (size_t)written < outSize;
 }
 
+static bool BuildSpendAmount(const signed_transaction_t* tx, uint256_t* outSpend) {
+    if (!tx || !outSpend) {
+        return false;
+    }
+
+    *outSpend = uint256_from_u64(0);
+    if (uint256_add_u64(outSpend, tx->transaction.amount1)) {
+        return false;
+    }
+    if (uint256_add_u64(outSpend, tx->transaction.amount2)) {
+        return false;
+    }
+    if (uint256_add_u64(outSpend, tx->transaction.fee)) {
+        return false;
+    }
+
+    return true;
+}
+
+static bool CreditAddress(const uint8_t address[32], uint64_t amount) {
+    if (!address || amount == 0) {
+        return true;
+    }
+
+    balance_sheet_entry_t entry;
+    if (BalanceSheet_Lookup((uint8_t*)address, &entry)) {
+        if (uint256_add_u64(&entry.balance, amount)) {
+            return false;
+        }
+    } else {
+        memset(&entry, 0, sizeof(entry));
+        memcpy(entry.address, address, 32);
+        entry.balance = uint256_from_u64(amount);
+    }
+
+    return BalanceSheet_Insert(entry) >= 0;
+}
+
+static bool DebitAddress(const uint8_t address[32], const uint256_t* amount) {
+    if (!address || !amount) {
+        return false;
+    }
+
+    balance_sheet_entry_t entry;
+    if (!BalanceSheet_Lookup((uint8_t*)address, &entry)) {
+        return false;
+    }
+
+    if (uint256_cmp(&entry.balance, amount) < 0) {
+        return false;
+    }
+
+    if (!uint256_subtract(&entry.balance, amount)) {
+        return false;
+    }
+
+    return BalanceSheet_Insert(entry) >= 0;
+}
+
 static void Chain_ClearBlocks(blockchain_t* chain) {
     if (!chain || !chain->blocks) {
         return;
@@ -72,15 +132,91 @@ void Chain_Destroy(blockchain_t* chain) {
 }
 
 bool Chain_AddBlock(blockchain_t* chain, block_t* block) {
-    if (chain && block && chain->blocks) {
+    if (!chain || !block || !chain->blocks) {
-        DynArr_push_back(chain->blocks, block);
+        return false;
-        chain->size++;
-        return true;
     }
 
+    if (!block->transactions) {
         return false;
     }
 
+    // First pass: ensure all non-coinbase senders can cover the full spend
+    // (amount1 + amount2 + fee) before mutating the chain or balance sheet.
+    size_t txCount = DynArr_size(block->transactions);
+    for (size_t i = 0; i < txCount; ++i) {
+        signed_transaction_t* tx = (signed_transaction_t*)DynArr_at(block->transactions, i);
+        if (!tx) {
+            return false;
+        }
+
+        if (Address_IsCoinbase(tx->transaction.senderAddress)) {
+            continue;
+        }
+
+        uint256_t spend;
+        if (!BuildSpendAmount(tx, &spend)) {
+            return false;
+        }
+
+        balance_sheet_entry_t senderEntry;
+        if (!BalanceSheet_Lookup(tx->transaction.senderAddress, &senderEntry)) {
+            fprintf(stderr, "Error: Sender address not found in balance sheet during block addition. Bailing!\n");
+            return false;
+        }
+
+        if (uint256_cmp(&senderEntry.balance, &spend) < 0) {
+            fprintf(stderr, "Error: Sender balance insufficient for block transaction. Bailing!\n");
+            return false;
+        }
+    }
+
+    // Push the block only after validation succeeds.
+    block_t* blk = (block_t*)DynArr_push_back(chain->blocks, block);
+    if (!blk) {
+        return false;
+    }
+    chain->size++;
+
+    // Second pass: apply the ledger changes.
+    if (blk->transactions) {
+        txCount = DynArr_size(blk->transactions);
+        for (size_t i = 0; i < txCount; ++i) {
+            signed_transaction_t* tx = (signed_transaction_t*)DynArr_at(blk->transactions, i);
+            if (!tx) {
+                continue;
+            }
+
+            if (!Address_IsCoinbase(tx->transaction.senderAddress)) {
+                uint256_t spend;
+                if (!BuildSpendAmount(tx, &spend) || !DebitAddress(tx->transaction.senderAddress, &spend)) {
+                    fprintf(stderr, "Error: Failed to debit sender balance during block addition. Bailing!\n");
+                    return false;
+                }
+            }
+
+            if (!CreditAddress(tx->transaction.recipientAddress1, tx->transaction.amount1)) {
+                fprintf(stderr, "Error: Failed to credit recipient1 balance during block addition. Bailing!\n");
+                return false;
+            }
+
+            if (tx->transaction.amount2 > 0) {
+                uint8_t zeroAddress[32] = {0};
+                if (memcmp(tx->transaction.recipientAddress2, zeroAddress, 32) == 0) {
+                    fprintf(stderr, "Error: amount2 is non-zero but recipient2 is empty during block addition. Bailing!\n");
+                    return false;
+                }
+
+                if (!CreditAddress(tx->transaction.recipientAddress2, tx->transaction.amount2)) {
+                    fprintf(stderr, "Error: Failed to credit recipient2 balance during block addition. Bailing!\n");
+                    return false;
+                }
+            }
+        }
+    }
+
+    return true;
+}
+
 block_t* Chain_GetBlock(blockchain_t* chain, size_t index) {
     if (chain) {
         return DynArr_at(chain->blocks, index);
@@ -121,6 +257,7 @@ bool Chain_IsValid(blockchain_t* chain) {
         // A potential issue is verifying PoW, since the chain read might only have header data without transactions.
         // A potnetial fix is verifying PoW as we go, when getting new blocks from peers, and only accepting blocks
         // with valid PoW, so that we can assume all blocks in the chain are valid in that regard.
+        // During the initial sync, we can verify the PoW, the validity of each transaction + coinbase, etc.
     }
     
     // Genesis needs special handling because the prevHash is always invalid (no previous block)
@@ -134,8 +271,9 @@ void Chain_Wipe(blockchain_t* chain) {
     Chain_ClearBlocks(chain);
 }
 
-bool Chain_SaveToFile(blockchain_t* chain, const char* dirpath, uint256_t currentSupply) {
+bool Chain_SaveToFile(blockchain_t* chain, const char* dirpath, uint256_t currentSupply, uint64_t currentReward) {
     // To avoid stalling the chain from peers, write after every block addition (THAT IS VERIFIED)
+    // TODO: Check fwrite() and fread() calls if they actually didn't error
 
     if (!chain || !chain->blocks || !EnsureDirectoryExists(dirpath)) {
         return false;
@@ -146,14 +284,25 @@ bool Chain_SaveToFile(blockchain_t* chain, const char* dirpath, uint256_t curren
         return false;
     }
 
-    // Find metadata file (create if not exists) to get the saved chain size (+ other things)
+    char chainPath[512];
-    FILE* metaFile = fopen(metaPath, "rb+");
+    if (!BuildPath(chainPath, sizeof(chainPath), dirpath, "chain.data")) {
-    if (!metaFile) {
-        metaFile = fopen(metaPath, "wb+");
-        if (!metaFile) {
         return false;
     }
     
+    char tablePath[512];
+    if (!BuildPath(tablePath, sizeof(tablePath), dirpath, "chain.table")) {
+        return false;
+    }
+    
+    // Find metadata file (create if not exists) to get the saved chain size (+ other things)
+    FILE* metaFile = fopen(metaPath, "rb+");
+    FILE* chainFile = fopen(chainPath, "rb+");
+    FILE* tableFile = fopen(tablePath, "rb+");
+    if (!metaFile || !chainFile || !tableFile) {
+        // Just overwrite everything
+        metaFile = fopen(metaPath, "wb+");
+        if (!metaFile) { return false; }
+
         // Initialize metadata with size 0
         size_t initialSize = 0;
         fwrite(&initialSize, sizeof(size_t), 1, metaFile);
@@ -162,6 +311,16 @@ bool Chain_SaveToFile(blockchain_t* chain, const char* dirpath, uint256_t curren
         fwrite(zeroHash, sizeof(uint8_t), 32, metaFile);
         uint256_t zeroSupply = {0};
         fwrite(&zeroSupply, sizeof(uint256_t), 1, metaFile);
+        uint32_t initialTarget = INITIAL_DIFFICULTY;
+        fwrite(&initialTarget, sizeof(uint32_t), 1, metaFile);
+        uint64_t initialReward = 0;
+        fwrite(&initialReward, sizeof(uint64_t), 1, metaFile);
+
+        chainFile = fopen(chainPath, "wb+");
+        if (!chainFile) { return false; }
+
+        tableFile = fopen(tablePath, "wb+");
+        if (!tableFile) { return false; }
 
         // TODO: Potentially some other things here, we'll see
     }
@@ -176,45 +335,66 @@ bool Chain_SaveToFile(blockchain_t* chain, const char* dirpath, uint256_t curren
     if (savedSize > DynArr_size(chain->blocks)) {
         // Saved chain is longer than current chain, this should not happen if we are always saving the current chain, but just in case, fail to save to avoid overwriting a potentially valid longer chain with a shorter one.
         fclose(metaFile);
+        fclose(chainFile);
+        fclose(tableFile);
         return false;
     }
 
-    // Filename formart: dirpath/block_{index}.dat
+    // Filename format: dirpath/chain.data
-    // File format: [block_header][num_transactions][transactions...] - since block_header is fixed size, LoadFromFile will only read those by default
+    // File format: ([block_header][num_transactions][transactions...])[*length] - since block_header is fixed size, LoadFromFile will only read those by default
+
+    fseek(chainFile, 0, SEEK_END); // Seek to the end of those files
+    fseek(tableFile, 0, SEEK_END);
+    long pos = ftell(chainFile);
+    if (pos < 0) {
+        fclose(metaFile);
+        fclose(chainFile);
+        fclose(tableFile);
+        return false;
+    }
+
+    uint64_t byteCount = (uint64_t)pos; // Get the size
 
     // Save blocks that are not yet saved
     for (size_t i = savedSize; i < DynArr_size(chain->blocks); i++) {
         block_t* blk = (block_t*)DynArr_at(chain->blocks, i);
         if (!blk) {
             fclose(metaFile);
+            fclose(chainFile);
+            fclose(tableFile);
             return false;
         }
 
+        uint64_t preIncrementByteSize = byteCount;
+
         // Construct file path
-        char filePath[256];
-        snprintf(filePath, sizeof(filePath), "%s/block_%zu.dat", dirpath, i);
-
-        FILE* blockFile = fopen(filePath, "wb");
-        if (!blockFile) {
-            fclose(metaFile);
-            return false;
-        }
-
         // Write block header
-        fwrite(&blk->header, sizeof(block_header_t), 1, blockFile);
+        fwrite(&blk->header, sizeof(block_header_t), 1, chainFile);
         size_t txSize = DynArr_size(blk->transactions);
-        fwrite(&txSize, sizeof(size_t), 1, blockFile); // Write number of transactions
+        fwrite(&txSize, sizeof(size_t), 1, chainFile); // Write number of transactions
+        byteCount += sizeof(block_header_t) + sizeof(size_t);
         // Write transactions
         for (size_t j = 0; j < txSize; j++) {
             signed_transaction_t* tx = (signed_transaction_t*)DynArr_at(blk->transactions, j);
-            if (fwrite(tx, sizeof(signed_transaction_t), 1, blockFile) != 1) {
+            if (fwrite(tx, sizeof(signed_transaction_t), 1, chainFile) != 1) {
-                fclose(blockFile);
+                fclose(chainFile);
                 fclose(metaFile);
+                fclose(tableFile);
                 return false;
             }
+
+            byteCount += sizeof(signed_transaction_t);
         }
 
-        fclose(blockFile);
+        // Create an entry in the block table
+        block_table_entry_t entry;
+        entry.blockNumber = i;
+        entry.byteNumber = preIncrementByteSize;
+        entry.blockSize = byteCount - preIncrementByteSize;
+        fwrite(&entry, sizeof(block_table_entry_t), 1, tableFile);
+
+        DynArr_destroy(blk->transactions);
+        blk->transactions = NULL; // Clear transactions to save memory since they're now saved on disk
     }
 
     // Update metadata with new size and last block hash
@@ -228,13 +408,25 @@ bool Chain_SaveToFile(blockchain_t* chain, const char* dirpath, uint256_t curren
         fwrite(lastHash, sizeof(uint8_t), 32, metaFile);
     }
     fwrite(&currentSupply, sizeof(uint256_t), 1, metaFile);
+    uint32_t difficultyTarget = ((block_t*)DynArr_at(chain->blocks, newSize - 1))->header.difficultyTarget;
+    fwrite(&difficultyTarget, sizeof(uint32_t), 1, metaFile);
+    fwrite(&currentReward, sizeof(uint64_t), 1, metaFile);
+
+    // Safety
+    fflush(metaFile);
+    fflush(chainFile);
+    fflush(tableFile);
+
+    // Close all pointers
     fclose(metaFile);
+    fclose(chainFile);
+    fclose(tableFile);
 
     return true;
 }
 
-bool Chain_LoadFromFile(blockchain_t* chain, const char* dirpath, uint256_t* outCurrentSupply) {
+bool Chain_LoadFromFile(blockchain_t* chain, const char* dirpath, uint256_t* outCurrentSupply, uint32_t* outDifficultyTarget, uint64_t* outCurrentReward, uint8_t* outLastSavedHash) {
-    if (!chain || !chain->blocks || !dirpath || !outCurrentSupply) {
+    if (!chain || !chain->blocks || !dirpath || !outCurrentSupply || !outLastSavedHash) {
         return false;
     }
 
@@ -248,17 +440,58 @@ bool Chain_LoadFromFile(blockchain_t* chain, const char* dirpath, uint256_t* out
         return false;
     }
 
+    char chainPath[512];
+    if (!BuildPath(chainPath, sizeof(chainPath), dirpath, "chain.data")) {
+        return false;
+    }
+    
+    char tablePath[512];
+    if (!BuildPath(tablePath, sizeof(tablePath), dirpath, "chain.table")) {
+        return false;
+    }
+
     // Read metadata file to get saved chain size (+ other things)
-    FILE* metaFile = fopen(metaPath, "rb");
+    FILE* metaFile = fopen(metaPath, "rb+");
-    if (!metaFile) {
+    FILE* chainFile = fopen(chainPath, "rb+");
+    FILE* tableFile = fopen(tablePath, "rb+");
+    if (!metaFile || !chainFile || !tableFile) {
+        if (metaFile) fclose(metaFile);
+        if (chainFile) fclose(chainFile);
+        if (tableFile) fclose(tableFile);
         return false;
     }
 
     size_t savedSize = 0;
-    fread(&savedSize, sizeof(size_t), 1, metaFile);
+    if (fread(&savedSize, sizeof(size_t), 1, metaFile) != 1) {
-    uint8_t lastSavedHash[32];
+        fclose(metaFile);
-    fread(lastSavedHash, sizeof(uint8_t), 32, metaFile);
+        fclose(chainFile);
-    fread(outCurrentSupply, sizeof(uint256_t), 1, metaFile);
+        fclose(tableFile);
+        return false;
+    }
+    if (fread(outLastSavedHash, sizeof(uint8_t), 32, metaFile) != 32) {
+        fclose(metaFile);
+        fclose(chainFile);
+        fclose(tableFile);
+        return false;
+    }
+    if (fread(outCurrentSupply, sizeof(uint256_t), 1, metaFile) != 1) {
+        fclose(metaFile);
+        fclose(chainFile);
+        fclose(tableFile);
+        return false;
+    }
+    if (fread(outDifficultyTarget, sizeof(uint32_t), 1, metaFile) != 1) {
+        fclose(metaFile);
+        fclose(chainFile);
+        fclose(tableFile);
+        return false;
+    }
+    if (fread(outCurrentReward, sizeof(uint64_t), 1, metaFile) != 1) {
+        fclose(metaFile);
+        fclose(chainFile);
+        fclose(tableFile);
+        return false;
+    }
     fclose(metaFile);
 
     // TODO: Might add a flag to allow reading from a point onward, but just rewrite for now
@@ -266,34 +499,52 @@ bool Chain_LoadFromFile(blockchain_t* chain, const char* dirpath, uint256_t* out
 
     // Load blocks
     for (size_t i = 0; i < savedSize; i++) {
-        // Construct file path
+        // Get the table entry
-        char filePath[256];
+        //fseek(tableFile, sizeof(block_table_entry_t) * i, SEEK_SET); // I think that fread() should take care of this for us
-        snprintf(filePath, sizeof(filePath), "%s/block_%zu.dat", dirpath, i);
+        block_table_entry_t loc;
-
+        if (fread(&loc, sizeof(block_table_entry_t), 1, tableFile) != 1) {
-        block_t* blk = Block_Create();
+            fclose(chainFile);
-        if (!blk) {
+            fclose(tableFile);
             return false;
         }
 
-        FILE* blockFile = fopen(filePath, "rb");
+        if (loc.blockNumber != i) {
-        if (!blockFile) {
+            fclose(chainFile);
-            Block_Destroy(blk);
+            fclose(tableFile);
+            return false; // Mismatch
+        }
+
+        // Seek to that position
+        if (fseek(chainFile, loc.byteNumber, SEEK_SET) != 0) {
+            fclose(chainFile);
+            fclose(tableFile);
+            return false;
+        }
+
+        // Header-only load path: do not allocate per-block transaction arrays.
+        block_t* blk = (block_t*)calloc(1, sizeof(block_t));
+        if (!blk) {
+            fclose(chainFile);
+            fclose(tableFile);
             return false;
         }
 
         // Read block header and transactions
-        if (fread(&blk->header, sizeof(block_header_t), 1, blockFile) != 1) {
+        if (fread(&blk->header, sizeof(block_header_t), 1, chainFile) != 1) {
-            fclose(blockFile);
+            fclose(chainFile);
-            Block_Destroy(blk);
+            fclose(tableFile);
+            free(blk);
             return false;
         }
 
         size_t txSize = 0;
-        if (fread(&txSize, sizeof(size_t), 1, blockFile) != 1) {
+        if (fread(&txSize, sizeof(size_t), 1, chainFile) != 1) {
-            fclose(blockFile);
+            fclose(chainFile);
-            Block_Destroy(blk);
+            fclose(tableFile);
+            free(blk);
             return false;
         }
+        (void)txSize;
 
         /*for (size_t j = 0; j < txSize; j++) {
             signed_transaction_t tx;
@@ -304,19 +555,102 @@ bool Chain_LoadFromFile(blockchain_t* chain, const char* dirpath, uint256_t* out
             }
             Block_AddTransaction(blk, &tx);
         }*/ // Transactions are not read, we use the merkle root for validity
-
-        fclose(blockFile);
-        Chain_AddBlock(chain, blk);
-
-        if (blk->transactions) {
-            DynArr_destroy(blk->transactions);
         blk->transactions = NULL;
+
+        // Loading from disk currently restores headers only. Do not run Chain_AddBlock,
+        // because it enforces transaction presence and mutates balances.
+        if (!DynArr_push_back(chain->blocks, blk)) {
+            fclose(chainFile);
+            fclose(tableFile);
+            free(blk);
+            return false;
         }
-        free(blk); // chain stores block headers/fields by value
+        chain->size++;
+
+        // DynArr_push_back stores blocks by value, so the copied block now owns
+        // blk->transactions (NULL in header-only load mode). Free wrapper only.
+        free(blk);
     }
 
     chain->size = savedSize;
+    fclose(chainFile);
+    fclose(tableFile);
 
     // After read, you SHOULD verify chain validity. We're not doing it here since returning false is a bit unclear if the read failed or if the chain is invalid.
     return true;
 }
+
+uint32_t Chain_ComputeNextTarget(blockchain_t* chain, uint32_t currentTarget) {
+    if (!chain || !chain->blocks) {
+        return 0x00; // Impossible difficulty, only valid hash is all zeros (practically impossible)
+    }
+
+    size_t chainSize = DynArr_size(chain->blocks);
+    if (chainSize < DIFFICULTY_ADJUSTMENT_INTERVAL) {
+        // Baby-chain, return initial difficulty
+        return INITIAL_DIFFICULTY;
+    }
+
+    // Assuming block validation validates timestamps, we can assume they're valid and can just read them
+    block_t* lastBlock = (block_t*)DynArr_at(chain->blocks, chainSize - 1);
+    block_t* adjustmentBlock = (block_t*)DynArr_at(chain->blocks, chainSize - DIFFICULTY_ADJUSTMENT_INTERVAL);
+    if (!lastBlock || !adjustmentBlock) {
+        return 0x00; // Impossible difficulty, only valid hash is all zeros (practically impossible)
+    }
+
+    // Retarget uses whole-window span. Per-block average is implicit:
+    // (actualTime / interval) / targetBlockTime == actualTime / targetTime.
+    uint64_t actualTime = 0;
+    if (lastBlock->header.timestamp > adjustmentBlock->header.timestamp) {
+        actualTime = lastBlock->header.timestamp - adjustmentBlock->header.timestamp;
+    }
+    if (actualTime == 0) {
+        return currentTarget; // Invalid/non-increasing time window; keep current target
+    }
+
+    const uint64_t targetTime = (uint64_t)TARGET_BLOCK_TIME * (uint64_t)DIFFICULTY_ADJUSTMENT_INTERVAL;
+    double timeRatio = (double)actualTime / (double)targetTime;
+
+    // Clamp per-epoch target movement: at most x2 easier or x2 harder. TODO: Check if the clamp should be more aggressive or looser
+    if (timeRatio > 2.0) {
+        timeRatio = 2.0;
+    } else if (timeRatio < 0.5) {
+        timeRatio = 0.5;
+    }
+
+    uint32_t exponent = currentTarget >> 24;
+    uint32_t mantissa = currentTarget & 0x007fffff;
+    if (mantissa == 0 || exponent == 0) {
+        return INITIAL_DIFFICULTY;
+    }
+
+    double newMantissa = (double)mantissa * timeRatio;
+
+    // Normalize to compact format range.
+    while (newMantissa > 8388607.0) { // 0x007fffff
+        newMantissa /= 256.0;
+        exponent++;
+    }
+    while (newMantissa > 0.0 && newMantissa < 32768.0 && exponent > 3) { // Keep coefficient in normal range
+        newMantissa *= 256.0;
+        exponent--;
+    }
+
+    if (exponent > 32) {
+        // Easiest representable target in our decoder range.
+        return (32u << 24) | 0x007fffff;
+    }
+    if (exponent < 1) {
+        exponent = 1;
+    }
+
+    uint32_t newCoeff = (uint32_t)newMantissa;
+    if (newCoeff == 0) {
+        newCoeff = 1;
+    }
+    if (newCoeff > 0x007fffff) {
+        newCoeff = 0x007fffff;
+    }
+
+    return (exponent << 24) | (newCoeff & 0x007fffff);
+}

src/block/transaction.c

@@ -1,6 +1,14 @@
 #include <block/transaction.h>
 #include <string.h>
 
+void Transaction_Init(signed_transaction_t* tx) {
+    if (!tx) { return; }
+    // Zero out everything
+    memset(tx, 0, sizeof(signed_transaction_t));
+
+    // NOTE: Other things might be added here
+}
+
 void Transaction_CalculateHash(const signed_transaction_t* tx, uint8_t* outHash) {
     if (!tx || !outHash) {
         return;
@@ -18,10 +26,11 @@ void Transaction_Sign(signed_transaction_t* tx, const uint8_t* privateKey) {
         return;
     }
 
-    Transaction_CalculateHash(tx, tx->signature.txHash);
+    uint8_t txHash[32];
+    Transaction_CalculateHash(tx, txHash);
     Crypto_SignData(
-        (const uint8_t*)&tx->transaction,
+        txHash,
-        sizeof(transaction_t),
+        32,
         privateKey,
         tx->signature.signature
     );
@@ -43,11 +52,11 @@ bool Transaction_Verify(const signed_transaction_t* tx) {
         return false; // Sender address does not match public key
     }
 
-    if (tx->transaction.amount == 0) {
+    if (tx->transaction.amount1 == 0) {
         return false; // Zero-amount transactions are not valid
     }
 
-    if (tx->transaction.fee > tx->transaction.amount) {
+    if (tx->transaction.fee > tx->transaction.amount1) {
         return false; // Fee cannot exceed amount
     }
 
@@ -55,20 +64,27 @@ bool Transaction_Verify(const signed_transaction_t* tx) {
         return false; // Unsupported version
     }
 
-    if (Address_IsCoinbase(tx->transaction.recipientAddress)) {
+    if (Address_IsCoinbase(tx->transaction.recipientAddress1) || Address_IsCoinbase(tx->transaction.recipientAddress2)) {
         return false; // Cannot send to coinbase address
     }
 
+    // Balance checks are stateful and are handled when a block is added to the chain.
+    // Transaction_Verify only checks transaction structure, addresses, and signature material.
+
+    if (tx->transaction.amount2 == 0) {
+        // If amount2 is zero, address2 must be all zeros
+        uint8_t zeroAddress[32] = {0};
+        if (memcmp(tx->transaction.recipientAddress2, zeroAddress, 32) != 0) {
+            return false; // amount2 is zero but address2 is not zeroed
+        }
+    }
+
     uint8_t txHash[32];
     Transaction_CalculateHash(tx, txHash);
 
-    if (memcmp(txHash, tx->signature.txHash, 32) != 0) {
-        return false; // Hash does not match signature hash
-    }
-
     // If all checks pass, verify the signature
     return Crypto_VerifySignature(
-        (const uint8_t*)&tx->transaction,
+        txHash,
         sizeof(transaction_t),
         tx->signature.signature,
         tx->transaction.compressedPublicKey

src/crypto/crypto.c

@@ -75,3 +75,13 @@ void Crypto_SignData(const uint8_t* data, size_t len, const uint8_t* privateKey,
     secp256k1_ecdsa_signature_serialize_compact(ctx, outSignature, &sig);
     secp256k1_context_destroy(ctx);
 }
+
+void to_hex(const uint8_t *in, char *out) {
+    static const char hex[] = "0123456789abcdef";
+
+    for (int i = 0; i < 32; i++) {
+        out[i * 2]     = hex[in[i] >> 4];
+        out[i * 2 + 1] = hex[in[i] & 0x0F];
+    }
+    out[64] = '\0';
+}

src/main.c

@@ -8,10 +8,14 @@
 #include <stdlib.h>
 #include <string.h>
 #include <time.h>
-#include <randomx/librx_wrapper.h>
 #include <signal.h>
+#include <balance_sheet.h>
 
 #include <constants.h>
+#include <autolykos2/autolykos2.h>
+#include <time.h>
+
+#include <nets/net_node.h>
 
 #ifndef CHAIN_DATA_DIR
 #define CHAIN_DATA_DIR "chain_data"
@@ -19,55 +23,124 @@
 
 void handle_sigint(int sig) {
     printf("Caught signal %d, exiting...\n", sig);
-    RandomX_Destroy();
+    Block_ShutdownPowContext();
+    BalanceSheet_Destroy();
     exit(0);
 }
 
-static double MonotonicSeconds(void) {
+uint32_t difficultyTarget = INITIAL_DIFFICULTY;
-    struct timespec ts;
+
-    clock_gettime(CLOCK_MONOTONIC, &ts);
+// extern the currentReward from constants.h so we can update it as we mine blocks and save it to disk
-    return (double)ts.tv_sec + ((double)ts.tv_nsec / 1000000000.0);
+extern uint64_t currentReward;
+
+static void AddressFromCompressedPubkey(const uint8_t compressedPubkey[33], uint8_t outAddress[32]) {
+    if (!compressedPubkey || !outAddress) {
+        return;
     }
 
-static double MeasureRandomXHashrate(void) {
+    SHA256(compressedPubkey, 33, outAddress);
-    uint8_t input[80] = {0};
-    uint8_t outHash[32];
-    uint64_t counter = 0;
-
-    const double start = MonotonicSeconds();
-    double now = start;
-    do {
-        memcpy(input, &counter, sizeof(counter));
-        RandomX_CalculateHash(input, sizeof(input), outHash);
-        counter++;
-        now = MonotonicSeconds();
-    } while ((now - start) < 0.75); // short local benchmark window
-
-    const double elapsed = now - start;
-    if (elapsed <= 0.0 || counter == 0) {
-        return 0.0;
 }
 
-    return (double)counter / elapsed;
+static bool GenerateTestMinerIdentity(uint8_t privateKey[32], uint8_t compressedPubkey[33], uint8_t address[32]) {
+    if (!privateKey || !compressedPubkey || !address) {
+        return false;
     }
 
-static uint32_t CompactTargetForExpectedHashes(double expectedHashes) {
+    secp256k1_context* ctx = secp256k1_context_create(SECP256K1_CONTEXT_SIGN);
-    if (expectedHashes < 1.0) {
+    if (!ctx) {
-        expectedHashes = 1.0;
+        return false;
     }
 
-    // For exponent 0x1f: target = mantissa * 2^(8*(0x1f-3)) = mantissa * 2^224
+    uint8_t seed[64];
-    // So expected hashes ~= 2^256 / target = 2^32 / mantissa.
+    secp256k1_pubkey pubkey;
-    double mantissaF = 4294967296.0 / expectedHashes;
+
-    if (mantissaF < 1.0) {
+    for (uint64_t counter = 0; counter < 1024; ++counter) {
-        mantissaF = 1.0;
+        const char* base = "skalacoin-test-miner-key";
-    }
+        size_t baseLen = strlen(base);
-    if (mantissaF > 8388607.0) {
+        memcpy(seed, base, baseLen);
-        mantissaF = 8388607.0; // 0x007fffff
+        memcpy(seed + baseLen, &counter, sizeof(counter));
+        SHA256(seed, baseLen + sizeof(counter), privateKey);
+
+        if (!secp256k1_ec_seckey_verify(ctx, privateKey)) {
+            continue;
         }
 
-    const uint32_t mantissa = (uint32_t)mantissaF;
+        if (!secp256k1_ec_pubkey_create(ctx, &pubkey, privateKey)) {
-    return (0x1fU << 24) | (mantissa & 0x007fffffU);
+            continue;
+        }
+
+        size_t pubLen = 33;
+        if (!secp256k1_ec_pubkey_serialize(ctx, compressedPubkey, &pubLen, &pubkey, SECP256K1_EC_COMPRESSED) || pubLen != 33) {
+            continue;
+        }
+
+        AddressFromCompressedPubkey(compressedPubkey, address);
+        secp256k1_context_destroy(ctx);
+        return true;
+    }
+
+    secp256k1_context_destroy(ctx);
+    return false;
+}
+
+static int testCounts = 0;
+static void MakeTestRecipientAddress(uint8_t outAddress[32]) {
+    if (!outAddress) {
+        return;
+    }
+
+    const char* label = "skalacoin-test-recipient-address-";
+    char buffer[256];
+    snprintf(buffer, sizeof(buffer), "%s%d", label, testCounts);
+    SHA256((const unsigned char*)buffer, strlen(buffer), outAddress);
+    testCounts++;
+}
+
+static void Uint256ToDecimal(const uint256_t* value, char* out, size_t outSize) {
+    if (!value || !out || outSize == 0) {
+        return;
+    }
+
+    uint64_t tmp[4] = {
+        value->limbs[0],
+        value->limbs[1],
+        value->limbs[2],
+        value->limbs[3]
+    };
+
+    if (tmp[0] == 0 && tmp[1] == 0 && tmp[2] == 0 && tmp[3] == 0) {
+        if (outSize >= 2) {
+            out[0] = '0';
+            out[1] = '\0';
+        } else {
+            out[0] = '\0';
+        }
+        return;
+    }
+
+    char digits[80];
+    size_t digitCount = 0;
+
+    while (tmp[0] != 0 || tmp[1] != 0 || tmp[2] != 0 || tmp[3] != 0) {
+        uint64_t remainder = 0;
+        for (int i = 3; i >= 0; --i) {
+            __uint128_t cur = ((__uint128_t)remainder << 64) | tmp[i];
+            tmp[i] = (uint64_t)(cur / 10u);
+            remainder = (uint64_t)(cur % 10u);
+        }
+
+        if (digitCount < sizeof(digits) - 1) {
+            digits[digitCount++] = (char)('0' + remainder);
+        } else {
+            break;
+        }
+    }
+
+    size_t writeLen = (digitCount < (outSize - 1)) ? digitCount : (outSize - 1);
+    for (size_t i = 0; i < writeLen; ++i) {
+        out[i] = digits[digitCount - 1 - i];
+    }
+    out[writeLen] = '\0';
 }
 
 static bool MineBlock(block_t* block) {
@@ -89,16 +162,18 @@ static bool MineBlock(block_t* block) {
 
 int main(int argc, char* argv[]) {
     signal(SIGINT, handle_sigint);
+    srand((unsigned int)time(NULL));
 
+    BalanceSheet_Init();
     const char* chainDataDir = CHAIN_DATA_DIR;
-    const uint64_t blocksToMine = 10;
+    const uint64_t blocksToMine = 1000;
     const double targetSeconds = TARGET_BLOCK_TIME;
 
     uint256_t currentSupply = uint256_from_u64(0);
 
-    // Init RandomX
+    net_node_t* node = Node_Create();
-    if (!RandomX_Init("minicoin", false)) { // TODO: Use a key that is not hardcoded; E.g. hash of the last block, every thousand blocks, difficulty recalibration, etc.
+    if (!node) {
-        fprintf(stderr, "failed to initialize RandomX\n");
+        BalanceSheet_Destroy();
         return 1;
     }
 
@@ -108,10 +183,34 @@ int main(int argc, char* argv[]) {
         return 1;
     }
 
-    if (!Chain_LoadFromFile(chain, chainDataDir, &currentSupply)) {
+    uint8_t lastSavedHash[32];
+    bool isFirstBlockOfLoadedChain = true;
+
+    if (!Chain_LoadFromFile(chain, chainDataDir, &currentSupply, &difficultyTarget, &currentReward, lastSavedHash)) {
         printf("No existing chain loaded from %s\n", chainDataDir);
     }
 
+    if (!BalanceSheet_LoadFromFile(chainDataDir)) {
+        printf("Failed to load the balance sheet or none existing\n");
+    }
+
+    const uint64_t effectivePhase1Blocks =
+        (PHASE1_TARGET_BLOCKS / EMISSION_ACCELERATION_FACTOR) > 0
+            ? (PHASE1_TARGET_BLOCKS / EMISSION_ACCELERATION_FACTOR)
+            : 1;
+
+    // During phase 1, reward is deterministic from (supply,height), so always recompute.
+    // This avoids using stale on-disk cached rewards (e.g. floor reward after genesis).
+    if ((uint64_t)Chain_Size(chain) < effectivePhase1Blocks || currentReward == 0) {
+        currentReward = CalculateBlockReward(currentSupply, chain);
+    }
+
+    {
+        uint8_t dagSeed[32];
+        GetNextDAGSeed(chain, dagSeed);
+        (void)Block_RebuildAutolykos2Dag(CalculateTargetDAGSize(chain), dagSeed);
+    }
+
     if (Chain_Size(chain) > 0) {
         if (Chain_IsValid(chain)) {
             printf("Loaded chain with %zu blocks from disk\n", Chain_Size(chain));
@@ -138,51 +237,54 @@ int main(int argc, char* argv[]) {
     if (argc > 1 && strcmp(argv[1], "-mine") == 0) {
         printf("Mining %llu blocks with target time %.0fs...\n", (unsigned long long)blocksToMine, targetSeconds);
 
-        const double hps = MeasureRandomXHashrate();
-        const double expectedHashes = (hps > 0.0) ? (hps * targetSeconds) : 65536.0;
-        const uint32_t calibratedBits = CompactTargetForExpectedHashes(expectedHashes);
-        //const uint32_t calibratedBits = 0xffffffff; // Absurdly low diff for testing
-
-        printf("RandomX benchmark: %.2f H/s, target %.0fs, nBits=0x%08x, diff=%.2f\n",
-            hps,
-            targetSeconds,
-            calibratedBits,
-            (double)(1.f / calibratedBits) * 4294967296.0); // Basic representation as a big number for now
-
         uint8_t minerAddress[32];
-        SHA256((const unsigned char*)"minicoin-miner-1", strlen("minicoin-miner-1"), minerAddress);
+        uint8_t minerPrivateKey[32];
+        uint8_t minerCompressedPubkey[33];
+        if (!GenerateTestMinerIdentity(minerPrivateKey, minerCompressedPubkey, minerAddress)) {
+            fprintf(stderr, "failed to generate test miner keypair\n");
+            Chain_Destroy(chain);
+            Block_ShutdownPowContext();
+            BalanceSheet_Destroy();
+            return 1;
+        }
 
         for (uint64_t mined = 0; mined < blocksToMine; ++mined) {
             block_t* block = Block_Create();
             if (!block) {
                 fprintf(stderr, "failed to create block\n");
                 Chain_Destroy(chain);
-                RandomX_Destroy();
+                Block_ShutdownPowContext();
                 return 1;
             }
 
             block->header.version = 1;
             block->header.blockNumber = (uint64_t)Chain_Size(chain);
             if (Chain_Size(chain) > 0) {
+                if (!isFirstBlockOfLoadedChain) {
                     block_t* lastBlock = Chain_GetBlock(chain, Chain_Size(chain) - 1);
                     if (lastBlock) {
                         Block_CalculateHash(lastBlock, block->header.prevHash);
                     } else {
                         memset(block->header.prevHash, 0, sizeof(block->header.prevHash));
                     }
+                } else {
+                    memcpy(block->header.prevHash, lastSavedHash, sizeof(lastSavedHash));
+                }
             } else {
                 memset(block->header.prevHash, 0, sizeof(block->header.prevHash));
             }
             block->header.timestamp = (uint64_t)time(NULL);
-            block->header.difficultyTarget = calibratedBits;
+            block->header.difficultyTarget = difficultyTarget;
             block->header.nonce = 0;
 
             signed_transaction_t coinbaseTx;
-            memset(&coinbaseTx, 0, sizeof(coinbaseTx));
+            Transaction_Init(&coinbaseTx);
             coinbaseTx.transaction.version = 1;
-            coinbaseTx.transaction.amount = CalculateBlockReward(currentSupply, block->header.blockNumber);
+            coinbaseTx.transaction.amount1 = currentReward;
             coinbaseTx.transaction.fee = 0;
-            memcpy(coinbaseTx.transaction.recipientAddress, minerAddress, sizeof(minerAddress));
+            memcpy(coinbaseTx.transaction.recipientAddress1, minerAddress, sizeof(minerAddress));
+            coinbaseTx.transaction.recipientAddress2[0] = 0; // Mark recipient 2 as unused
+            coinbaseTx.transaction.amount2 = 0;
             memset(coinbaseTx.transaction.compressedPublicKey, 0, sizeof(coinbaseTx.transaction.compressedPublicKey));
             memset(coinbaseTx.transaction.senderAddress, 0xFF, sizeof(coinbaseTx.transaction.senderAddress));
             Block_AddTransaction(block, &coinbaseTx);
@@ -195,7 +297,7 @@ int main(int argc, char* argv[]) {
                 fprintf(stderr, "failed to mine block within nonce range\n");
                 Block_Destroy(block);
                 Chain_Destroy(chain);
-                RandomX_Destroy();
+                Block_ShutdownPowContext();
                 return 1;
             }
 
@@ -203,51 +305,190 @@ int main(int argc, char* argv[]) {
                 fprintf(stderr, "failed to append block to chain\n");
                 Block_Destroy(block);
                 Chain_Destroy(chain);
-                RandomX_Destroy();
+                Block_ShutdownPowContext();
                 return 1;
             }
 
-            (void)uint256_add_u64(&currentSupply, coinbaseTx.transaction.amount);
+            (void)uint256_add_u64(&currentSupply, coinbaseTx.transaction.amount1);
+            char supplyStr[80];
+            Uint256ToDecimal(&currentSupply, supplyStr, sizeof(supplyStr));
 
-            uint8_t blockHash[32];
+            uint8_t canonicalHash[32];
-            Block_CalculateHash(block, blockHash);
+            uint8_t powHash[32];
-            printf("Mined block %llu/%llu (height=%llu) nonce=%llu reward=%llu supply=%llu merkle=%02x%02x%02x%02x... hash=%02x%02x%02x%02x...\n",
+            Block_CalculateHash(block, canonicalHash);
+            Block_CalculateAutolykos2Hash(block, powHash);
+            printf("Mined block %llu/%llu (height=%llu) nonce=%llu reward=%llu supply=%s diff=%#x merkle=%02x%02x%02x%02x... pow=%02x%02x%02x%02x... canonical=%02x%02x%02x%02x...\n",
                 (unsigned long long)(mined + 1),
                 (unsigned long long)blocksToMine,
                 (unsigned long long)block->header.blockNumber,
                 (unsigned long long)block->header.nonce,
-                (unsigned long long)coinbaseTx.transaction.amount,
+                (unsigned long long)coinbaseTx.transaction.amount1,
-                (unsigned long long)currentSupply.limbs[0],
+                supplyStr,
+                (unsigned int)block->header.difficultyTarget,
                 block->header.merkleRoot[0], block->header.merkleRoot[1], block->header.merkleRoot[2], block->header.merkleRoot[3],
-                blockHash[0], blockHash[1], blockHash[2], blockHash[3]);
+                powHash[0], powHash[1], powHash[2], powHash[3],
+                canonicalHash[0], canonicalHash[1], canonicalHash[2], canonicalHash[3]);
 
             free(block); // chain stores blocks by value; transactions are owned by chain copy
 
-            // Save chain after each mined block
+            currentReward = CalculateBlockReward(currentSupply, chain); // Update the global currentReward for the next block
-            Chain_SaveToFile(chain, chainDataDir, currentSupply);
+
+            // Save chain after each mined block; NOTE: In reality, blocks will appear every ~90s, so this won't be a realistic bottleneck on the mainnet
+            // Persist the reward for the *next* block so restart behavior is correct.
+            printf("Saving chain at height %zu...\n", Chain_Size(chain));
+            Chain_SaveToFile(chain, chainDataDir, currentSupply, currentReward);
+            
+            if (Chain_Size(chain) % DIFFICULTY_ADJUSTMENT_INTERVAL == 0) {
+                difficultyTarget = Chain_ComputeNextTarget(chain, difficultyTarget);
             }
 
-        if (!Chain_SaveToFile(chain, chainDataDir, currentSupply)) {
+            if (Chain_Size(chain) % EPOCH_LENGTH == 0 && Chain_Size(chain) > 0) {
-            fprintf(stderr, "failed to save chain to %s\n", chainDataDir);
+                uint8_t dagSeed[32];
+                GetNextDAGSeed(chain, dagSeed);
+                (void)Block_RebuildAutolykos2Dag(CalculateTargetDAGSize(chain), dagSeed);
+            }
+
+            isFirstBlockOfLoadedChain = false;
+        }
+
+        // Post-loop test: spend some coins from the miner address to a different address.
+        // This validates sender balance checks, transaction signing, merkle root generation,
+        // and PoW mining for a non-coinbase transaction.
+        signed_transaction_t spends[100];
+        for (int i = 0; i < 100; i++) {
+            int rng = rand() % 10; // Random amount between 0 and 9 (inclusive)
+            const uint64_t spendAmount = rng * DECIMALS;
+            uint8_t recipientAddress[32];
+            MakeTestRecipientAddress(recipientAddress);
+
+            signed_transaction_t spendTx;
+            Transaction_Init(&spendTx);
+            spendTx.transaction.version = 1;
+            spendTx.transaction.fee = 0;
+            spendTx.transaction.amount1 = spendAmount;
+            spendTx.transaction.amount2 = 0;
+            memcpy(spendTx.transaction.senderAddress, minerAddress, sizeof(minerAddress));
+            memcpy(spendTx.transaction.recipientAddress1, recipientAddress, sizeof(recipientAddress));
+            memset(spendTx.transaction.recipientAddress2, 0, sizeof(spendTx.transaction.recipientAddress2));
+            memcpy(spendTx.transaction.compressedPublicKey, minerCompressedPubkey, sizeof(minerCompressedPubkey));
+
+            Transaction_Sign(&spendTx, minerPrivateKey);
+            spends[i] = spendTx;
+        }
+
+        block_t* spendBlock = Block_Create();
+        if (!spendBlock) {
+            fprintf(stderr, "failed to create test spend block\n");
+            Chain_Destroy(chain);
+            Block_ShutdownPowContext();
+            BalanceSheet_Destroy();
+            return 1;
+        }
+
+        spendBlock->header.version = 1;
+        spendBlock->header.blockNumber = (uint64_t)Chain_Size(chain);
+        if (Chain_Size(chain) > 0) {
+            block_t* lastBlock = Chain_GetBlock(chain, Chain_Size(chain) - 1);
+            if (lastBlock) {
+                Block_CalculateHash(lastBlock, spendBlock->header.prevHash);
             } else {
-            printf("Saved chain with %zu blocks to %s (supply=%llu)\n",
+                memset(spendBlock->header.prevHash, 0, sizeof(spendBlock->header.prevHash));
-                Chain_Size(chain),
-                chainDataDir,
-                (unsigned long long)currentSupply.limbs[0]);
             }
         } else {
-        printf("Current chain has %zu blocks, total supply %llu\n", Chain_Size(chain), (unsigned long long)currentSupply.limbs[0]);
+            memset(spendBlock->header.prevHash, 0, sizeof(spendBlock->header.prevHash));
+        }
+        spendBlock->header.timestamp = (uint64_t)time(NULL);
+        spendBlock->header.difficultyTarget = difficultyTarget;
+        spendBlock->header.nonce = 0;
+
+        signed_transaction_t testCoinbaseTx;
+        Transaction_Init(&testCoinbaseTx);
+        memset(&testCoinbaseTx, 0, sizeof(testCoinbaseTx));
+        testCoinbaseTx.transaction.version = 1;
+        testCoinbaseTx.transaction.amount1 = currentReward;
+        testCoinbaseTx.transaction.fee = 0;
+        memcpy(testCoinbaseTx.transaction.recipientAddress1, minerAddress, sizeof(minerAddress));
+        testCoinbaseTx.transaction.recipientAddress2[0] = 0;
+        testCoinbaseTx.transaction.amount2 = 0;
+        memset(testCoinbaseTx.transaction.compressedPublicKey, 0, sizeof(testCoinbaseTx.transaction.compressedPublicKey));
+        memset(testCoinbaseTx.transaction.senderAddress, 0xFF, sizeof(testCoinbaseTx.transaction.senderAddress));
+
+        Block_AddTransaction(spendBlock, &testCoinbaseTx);
+        for (int i = 0; i < 100; i++) {
+            Block_AddTransaction(spendBlock, &spends[i]);
+        }
+
+        uint8_t merkleRoot[32];
+        Block_CalculateMerkleRoot(spendBlock, merkleRoot);
+        memcpy(spendBlock->header.merkleRoot, merkleRoot, sizeof(spendBlock->header.merkleRoot));
+
+        if (!MineBlock(spendBlock)) {
+            fprintf(stderr, "failed to mine test spend block\n");
+            Block_Destroy(spendBlock);
+            Chain_Destroy(chain);
+            Block_ShutdownPowContext();
+            BalanceSheet_Destroy();
+            return 1;
+        }
+
+        if (!Chain_AddBlock(chain, spendBlock)) {
+            fprintf(stderr, "failed to append test spend block to chain\n");
+            Block_Destroy(spendBlock);
+            Chain_Destroy(chain);
+            Block_ShutdownPowContext();
+            BalanceSheet_Destroy();
+            return 1;
+        }
+
+        (void)uint256_add_u64(&currentSupply, testCoinbaseTx.transaction.amount1);
+        currentReward = CalculateBlockReward(currentSupply, chain);
+
+        //printf("Mined test spend block (height=%llu) sending %llu base units to a new address\n",
+        //    (unsigned long long)spendBlock->header.blockNumber,
+        //    (unsigned long long)spendAmount);
+
+        free(spendBlock);
+
+        bool chainSaved = Chain_SaveToFile(chain, chainDataDir, currentSupply, currentReward);
+        bool sheetSaved = BalanceSheet_SaveToFile(chainDataDir);
+        if (!chainSaved || !sheetSaved) {
+            if (!chainSaved) {
+                fprintf(stderr, "failed to save chain to %s\n", chainDataDir);
+            }
+            if (!sheetSaved) {
+                fprintf(stderr, "failed to save balance sheet to %s\n", chainDataDir);
+            }
+        } else {
+            char supplyStr[80];
+            Uint256ToDecimal(&currentSupply, supplyStr, sizeof(supplyStr));
+            printf("Saved chain with %zu blocks to %s (supply=%s)\n",
+                Chain_Size(chain),
+                chainDataDir,
+                supplyStr);
+        }
+    } else {
+        char supplyStr[80];
+        Uint256ToDecimal(&currentSupply, supplyStr, sizeof(supplyStr));
+        printf("Current chain has %zu blocks, total supply %s\n", Chain_Size(chain), supplyStr);
     }
 
     // Print chain
-    for (size_t i = 0; i < Chain_Size(chain); i++) {
+    /*for (size_t i = 0; i < Chain_Size(chain); i++) {
         block_t* blk = Chain_GetBlock(chain, i);
         if (blk) {
             Block_Print(blk);
         }
+    }*/
+
+    BalanceSheet_Print();
+    if (!BalanceSheet_SaveToFile(chainDataDir)) {
+        fprintf(stderr, "failed to save balance sheet to %s\n", chainDataDir);
     }
 
     Chain_Destroy(chain);
-    RandomX_Destroy();
+    Block_ShutdownPowContext();
+
+    Node_Destroy(node);
+
     return 0;
 }

src/nets/net_node.c

@@ -0,0 +1,43 @@
+#include <nets/net_node.h>
+
+net_node_t* Node_Create() {
+    net_node_t* node = (net_node_t*)malloc(sizeof(net_node_t));
+    if (!node) { return NULL; }
+
+    node->server = TcpServer_Create();
+    if (!node->server) {
+        free(node);
+        return NULL;
+    }
+
+    TcpServer_Init(node->server, LISTEN_PORT, "0.0.0.0"); // All interfaces
+    
+    // Register callbacks before starting the server
+    node->server->on_connect = Node_Server_OnConnect;
+    node->server->on_data = Node_Server_OnData;
+    node->server->on_disconnect = Node_Server_OnDisconnect;
+    
+    TcpServer_Start(node->server, MAX_CONS);
+
+    return node;
+}
+
+void Node_Destroy(net_node_t* node) {
+    if (!node || !node->server) { return; }
+    TcpServer_Stop(node->server);
+    TcpServer_Destroy(node->server);
+
+    free(node);
+}
+
+void Node_Server_OnConnect(tcp_connection_t* client) {
+    printf("A node connected!\n");
+}
+
+void Node_Server_OnData(tcp_connection_t* client) {
+    printf("A node sent data!\n");
+}
+
+void Node_Server_OnDisconnect(tcp_connection_t* client) {
+    printf("A node disconnected!\n");
+}

src/randomx/librx_wrapper.c

@@ -1,75 +0,0 @@
-#include <randomx/librx_wrapper.h>
-
-#include <string.h>
-#include <stdio.h>
-#include <stdlib.h>
-
-static randomx_cache* rxCache = NULL;
-static randomx_dataset* rxDataset = NULL;
-static randomx_vm* rxVm = NULL;
-
-bool RandomX_Init(const char* key, bool preferFullMemory) {
-    if (!key || rxCache || rxVm) {
-        return false;
-    }
-
-    const randomx_flags baseFlags = randomx_get_flags() | RANDOMX_FLAG_JIT;
-    randomx_flags vmFlags = baseFlags | RANDOMX_FLAG_FULL_MEM;
-
-    rxCache = randomx_alloc_cache(baseFlags);
-    if (!rxCache) {
-        return false;
-    }
-
-    randomx_init_cache(rxCache, key, strlen(key));
-
-    // Prefer full-memory mode. If dataset allocation fails, fall back to light mode.
-    if (preferFullMemory) {
-        rxDataset = randomx_alloc_dataset(vmFlags);
-        if (rxDataset) {
-            const unsigned long datasetItems = randomx_dataset_item_count();
-            randomx_init_dataset(rxDataset, rxCache, 0, datasetItems);
-            rxVm = randomx_create_vm(vmFlags, NULL, rxDataset);
-            if (rxVm) {
-                printf("RandomX initialized in full-memory mode\n");
-                return true;
-            }
-
-            randomx_release_dataset(rxDataset);
-            rxDataset = NULL;
-        }
-    }
-
-    vmFlags = baseFlags;
-    rxVm = randomx_create_vm(vmFlags, rxCache, NULL);
-    if (!rxVm) {
-        randomx_release_cache(rxCache);
-        rxCache = NULL;
-        return false;
-    }
-
-    printf("RandomX initialized in light mode\n");
-    return true;
-}
-
-void RandomX_Destroy() {
-    if (rxVm) {
-        randomx_destroy_vm(rxVm);
-        rxVm = NULL;
-    }
-    if (rxDataset) {
-        randomx_release_dataset(rxDataset);
-        rxDataset = NULL;
-    }
-    if (rxCache) {
-        randomx_release_cache(rxCache);
-        rxCache = NULL;
-    }
-}
-
-void RandomX_CalculateHash(const uint8_t* input, size_t inputLen, uint8_t* output) {
-    if (!rxVm || !input || !output) {
-        return;
-    }
-    randomx_calculate_hash(rxVm, input, inputLen, output);
-}

src/tcpd/tcpserver.c

@@ -1,7 +1,9 @@
+#ifndef _WIN32
+
 #include <tcpd/tcpserver.h>
 
-TcpServer* TcpServer_Create() {
+tcp_server_t* TcpServer_Create() {
-    TcpServer* svr = (TcpServer*)malloc(sizeof(TcpServer));
+    tcp_server_t* svr = (tcp_server_t*)malloc(sizeof(tcp_server_t));
 
     if (!svr) {
         perror("tcpserver - creation failure");
@@ -20,7 +22,7 @@ TcpServer* TcpServer_Create() {
     return svr;
 }
 
-void TcpServer_Destroy(TcpServer* ptr) {
+void TcpServer_Destroy(tcp_server_t* ptr) {
     if (ptr) {
         if (ptr->clientsArrPtr) {
             for (size_t i = 0; i < ptr->clients; i++) {
@@ -37,7 +39,7 @@ void TcpServer_Destroy(TcpServer* ptr) {
     }
 }
 
-void TcpServer_Init(TcpServer* ptr, unsigned short port, const char* addr) {
+void TcpServer_Init(tcp_server_t* ptr, unsigned short port, const char* addr) {
     if (ptr) {
         // Create socket
         ptr->sockFd = socket(AF_INET, SOCK_STREAM, 0);
@@ -74,8 +76,8 @@ void* TcpServer_clientthreadprocess(void* ptr) {
 
     tcpclient_thread_args* args = (tcpclient_thread_args*)ptr;
 
-    TcpClient* cli = args->clientPtr;
+    tcp_connection_t* cli = args->clientPtr;
-    TcpServer* svr = args->serverPtr;
+    tcp_server_t* svr = args->serverPtr;
 
     if (args) {
         free(args);
@@ -97,13 +99,15 @@ void* TcpServer_clientthreadprocess(void* ptr) {
         pthread_testcancel(); // Check for thread death
     }
 
+    if (cli->on_disconnect) {
         cli->on_disconnect(cli);
+    }
 
     // Close on exit
     close(cli->clientFd);
 
     // Destroy
-    TcpClient** arr = svr->clientsArrPtr;
+    tcp_connection_t** arr = svr->clientsArrPtr;
     size_t idx = Generic_FindClientInArrayByPtr(arr, cli, svr->clients);
     if (idx != SIZE_MAX) {
         if (arr[idx]) {
@@ -126,9 +130,9 @@ void* TcpServer_threadprocess(void* ptr) {
         return NULL;
     }
     
-    TcpServer* svr = (TcpServer*)ptr;
+    tcp_server_t* svr = (tcp_server_t*)ptr;
     while (1) {
-        TcpClient tempclient;
+        tcp_connection_t tempclient;
         socklen_t clientsize = sizeof(tempclient.clientAddr);
         int client = accept(svr->sockFd, (struct sockaddr*)&tempclient.clientAddr, &clientsize);
         if (client >= 0) {
@@ -137,7 +141,7 @@ void* TcpServer_threadprocess(void* ptr) {
             tempclient.on_disconnect = svr->on_disconnect;
 
             // I'm lazy, so I'm just copying the data for now (I should probably make this a better way)
-            TcpClient* heapCli = (TcpClient*)malloc(sizeof(TcpClient));
+            tcp_connection_t* heapCli = (tcp_connection_t*)malloc(sizeof(tcp_connection_t));
             if (!heapCli) {
                 perror("tcpserver - client failed to allocate");
                 exit(EXIT_FAILURE); // Wtf just happened???
@@ -193,7 +197,7 @@ void* TcpServer_threadprocess(void* ptr) {
     return NULL;
 }
 
-void TcpServer_Start(TcpServer* ptr, int maxcons) {
+void TcpServer_Start(tcp_server_t* ptr, int maxcons) {
     if (ptr) {
         if (listen(ptr->sockFd, maxcons) < 0) {
             perror("tcpserver - listen");
@@ -202,7 +206,7 @@ void TcpServer_Start(TcpServer* ptr, int maxcons) {
         }
 
         ptr->clients = maxcons;
-        ptr->clientsArrPtr = (TcpClient**)malloc(sizeof(TcpClient*) * maxcons);
+        ptr->clientsArrPtr = (tcp_connection_t**)malloc(sizeof(tcp_connection_t*) * maxcons);
 
         if (!ptr->clientsArrPtr) {
             perror("tcpserver - allocation of client space fatally errored");
@@ -219,7 +223,7 @@ void TcpServer_Start(TcpServer* ptr, int maxcons) {
     pthread_create(&ptr->svrThread, NULL, TcpServer_threadprocess, ptr);
 }
 
-void TcpServer_Stop(TcpServer* ptr) {
+void TcpServer_Stop(tcp_server_t* ptr) {
     if (ptr && ptr->svrThread != 0) {
         // Stop server
         pthread_cancel(ptr->svrThread);
@@ -227,7 +231,7 @@ void TcpServer_Stop(TcpServer* ptr) {
 
         // Disconnect clients
         for (size_t i = 0; i < ptr->clients; i++) {
-            TcpClient* cliPtr = ptr->clientsArrPtr[i];
+            tcp_connection_t* cliPtr = ptr->clientsArrPtr[i];
             if (cliPtr) {
                 close(cliPtr->clientFd);
                 pthread_cancel(cliPtr->clientThread);
@@ -238,7 +242,7 @@ void TcpServer_Stop(TcpServer* ptr) {
     }
 }
 
-void TcpServer_Send(TcpServer* ptr, TcpClient* cli, void* data, size_t len) {
+void TcpServer_Send(tcp_server_t* ptr, tcp_connection_t* cli, void* data, size_t len) {
     if (ptr && cli && data && len > 0) {
         size_t sent = 0;
         while (sent < len) {
@@ -267,7 +271,7 @@ void Generic_SendSocket(int sock, void* data, size_t len) {
     }
 }
 
-void TcpServer_Disconnect(TcpServer* ptr, TcpClient* cli) {
+void TcpServer_Disconnect(tcp_server_t* ptr, tcp_connection_t* cli) {
     if (ptr && cli) {
         close(cli->clientFd);
         pthread_cancel(cli->clientThread);
@@ -284,7 +288,7 @@ void TcpServer_Disconnect(TcpServer* ptr, TcpClient* cli) {
     }
 }
 
-void TcpServer_KillClient(TcpServer* ptr, TcpClient* cli) {
+void TcpServer_KillClient(tcp_server_t* ptr, tcp_connection_t* cli) {
     if (ptr && cli) {
         // RST the connection
         struct linger so_linger;
@@ -306,7 +310,7 @@ void TcpServer_KillClient(TcpServer* ptr, TcpClient* cli) {
     }
 }
 
-size_t Generic_FindClientInArrayByPtr(TcpClient** arr, TcpClient* ptr, size_t len) {
+size_t Generic_FindClientInArrayByPtr(tcp_connection_t** arr, tcp_connection_t* ptr, size_t len) {
     for (size_t i = 0; i < len; i++) {
         if (arr[i] == ptr) {
             return i;
@@ -315,3 +319,5 @@ size_t Generic_FindClientInArrayByPtr(TcpClient** arr, TcpClient* ptr, size_t le
 
     return SIZE_MAX; // Returns max unsigned, likely improbable to be correct
 }
+
+#endif