%\documentclass[sigconf, anonymous]{acmart}

\documentclass[conference,compsoc]{IEEEtran}
\IEEEoverridecommandlockouts

\usepackage[utf8]{inputenc}
\usepackage{amsmath,amssymb,amsfonts,amsthm,bm,bbm}
%\usepackage[usenames]{xcolor}
\usepackage{textcomp}
\usepackage{xcolor}
\PassOptionsToPackage{usenames,dvipsnames}{xcolor}
\newcommand{\todo}[1]{\textcolor{red}{#1}}
\newcommand{\suggestion}[1]{\textcolor{blue}{#1}}
\newcommand{\solution}[1]{\textcolor{ACMGreen}{#1}}
\newcommand{\failed}[1]{\textcolor{ACMPurple}{#1}}


\newcommand{\hash}[1]{\(\mathfrak{h}(#1)\)}
\newcommand{\diff}[1]{\(\mathfrak{diff}(#1)\)}
\newcommand{\target}[1]{\(\mathfrak{target}(#1)\)}
\newcommand{\level}[1]{\(\mathfrak{level}(#1)\)}

\DeclareMathOperator{\polylog}{poly \log}
% Tables
\usepackage{tabularx}
\usepackage{booktabs}
\usepackage{adjustbox}
\usepackage{array}

% Figures
\usepackage{subcaption}

% Algorithms
\usepackage{algorithm}
\usepackage{algpseudocode}

% Paragraph style
\usepackage{titlesec}
\titleformat*{\paragraph}{\bfseries}

% Comments
\newif \ifhidecomment
\hidecommenttrue
\hidecommentfalse % comment to hide comments
\newcommand\LM[1]{\ifhidecomment{}\else{\textcolor{blue}{LM: #1}}\fi}

\usepackage{ stmaryrd }
\newtheorem{theorem}{Theorem}
\newtheorem{definition}{Definition}

%\fancyhf{} % Remove fancy page headers 
%\fancyhead[C]{Anonymous submission \#9999 to ACM CCS 2023} % TODO: replace 9999 with your paper number
%\fancyfoot[C]{\thepage}

%\setcopyright{none} % No copyright notice required for submissions
%\acmConference[Anonymous Submission to ACM CCS 2023]{ACM Conference on Computer and Communications Security}{Due 15 May 2023}{London, TBD}
%\acmYear{2023}

%\settopmatter{printacmref=false, printccs=true, printfolios=true} % We want page numbers on submissions

%%\ccsPaper{9999} % TODO: replace with your paper number once obtained

\begin{document}
\title{Mining in Logarithmic Space with Variable Difficulty} % TODO: replace with your title
\author{}
\maketitle

\begin{abstract}
    This paper addresses the lack of scalability in current blockchain technology and its hindrance to widespread adoption.
    Blockchain data is categorized into application data and consensus data, with consensus data growing unboundedly at a constant linear rate in time.
    Recently, a protocol to reduce storage and communication complexity of blockchains to $O(polylog(n))$ was proposed, but its security was only proven in a static context.
    
    This paper focuses on modifying the protocol to fit a dynamic environment, with participants joining or leaving the network, and proving the upkeep of security properties in this context.
    The contributions of this paper include a study of the protocol in the dynamic context, its modification, and proof of properties in the dynamic context.
\end{abstract}

% TODO: replace this section with code generated by the tool at https://dl.acm.org/ccs.cfm
% \begin{CCSXML}
%     <ccs2012>
%     <concept>
%     <concept_id>10002978.10003006.10003013</concept_id>
%     <concept_desc>Security and privacy~Distributed systems security</concept_desc>
%     <concept_significance>500</concept_significance>
%     </concept>
%     <concept>
%     <concept_id>10002978.10002979</concept_id>
%     <concept_desc>Security and privacy~Cryptography</concept_desc>
%     <concept_significance>300</concept_significance>
%     </concept>
%     </ccs2012>
% \end{CCSXML}

% \ccsdesc[500]{Security and privacy~Distributed systems security}
% \ccsdesc[300]{Security and privacy~Cryptography}
% % -- end of section to replace with generated code

% \keywords{blockchains; proof-of-work; logspace mining; superlight clients; NIPoPoWs; superblocks; variable difficulty} % TODO: replace with your keywords


\input{ccs-body} % TODO: replace with your brilliant paper!

\bibliographystyle{plain}
\bibliography{ccs-sample}

\end{document}
