@article{1215,
  abstract     = {Two generalizations of Itô formula to infinite-dimensional spaces are given.
The first one, in Hilbert spaces, extends the classical one by taking advantage of
cancellations when they occur in examples and it is applied to the case of a group
generator. The second one, based on the previous one and a limit procedure, is an Itô
formula in a special class of Banach spaces having a product structure with the noise
in a Hilbert component; again the key point is the extension due to a cancellation. This
extension to Banach spaces and in particular the specific cancellation are motivated
by path-dependent Itô calculus.},
  author       = {Flandoli, Franco and Russo, Francesco and Zanco, Giovanni A},
  journal      = {Journal of Theoretical Probability},
  number       = {2},
  pages        = {789--826},
  publisher    = {Springer},
  title        = {{Infinite-dimensional calculus under weak spatial regularity of the processes}},
  doi          = {10.1007/s10959-016-0724-2},
  volume       = {31},
  year         = {2018},
}

@article{13,
  abstract     = {We propose a new method for fabricating digital objects through reusable silicone molds. Molds are generated by casting liquid silicone into custom 3D printed containers called metamolds. Metamolds automatically define the cuts that are needed to extract the cast object from the silicone mold. The shape of metamolds is designed through a novel segmentation technique, which takes into account both geometric and topological constraints involved in the process of mold casting. Our technique is simple, does not require changing the shape or topology of the input objects, and only requires off-the- shelf materials and technologies. We successfully tested our method on a set of challenging examples with complex shapes and rich geometric detail. © 2018 Association for Computing Machinery.},
  author       = {Alderighi, Thomas and Malomo, Luigi and Giorgi, Daniela and Pietroni, Nico and Bickel, Bernd and Cignoni, Paolo},
  journal      = {ACM Trans. Graph.},
  number       = {4},
  publisher    = {ACM},
  title        = {{Metamolds: Computational design of silicone molds}},
  doi          = {10.1145/3197517.3201381},
  volume       = {37},
  year         = {2018},
}

@misc{13055,
  abstract     = {Dataset for manuscript 'Social network plasticity decreases disease transmission in a eusocial insect'
Compared to previous versions: - raw image files added
                                                     - correction of URLs within README.txt file
},
  author       = {Stroeymeyt, Nathalie and Grasse, Anna V and Crespi, Alessandro and Mersch, Danielle and Cremer, Sylvia and Keller, Laurent},
  publisher    = {Zenodo},
  title        = {{Social network plasticity decreases disease transmission in a eusocial insect}},
  doi          = {10.5281/ZENODO.1322669},
  year         = {2018},
}

@misc{13059,
  abstract     = {This dataset contains a GitHub repository containing all the data, analysis, Nextflow workflows and Jupyter notebooks to replicate the manuscript titled "Fast and accurate large multiple sequence alignments with a root-to-leaf regressive method".
It also contains the Multiple Sequence Alignments (MSAs) generated and well as the main figures and tables from the manuscript.
The repository is also available at GitHub (https://github.com/cbcrg/dpa-analysis) release `v1.2`.
For details on how to use the regressive alignment algorithm, see the T-Coffee software suite (https://github.com/cbcrg/tcoffee).},
  author       = {Garriga, Edgar and di Tommaso, Paolo and Magis, Cedrik and Erb, Ionas and Mansouri, Leila and Baltzis, Athanasios and Laayouni, Hafid and Kondrashov, Fyodor and Floden, Evan and Notredame, Cedric},
  publisher    = {Zenodo},
  title        = {{Fast and accurate large multiple sequence alignments with a root-to-leaf regressive method}},
  doi          = {10.5281/ZENODO.2025846},
  year         = {2018},
}

@article{131,
  abstract     = {XY systems usually show chromosome-wide compensation of X-linked genes, while in many ZW systems, compensation is restricted to a minority of dosage-sensitive genes. Why such differences arose is still unclear. Here, we combine comparative genomics, transcriptomics and proteomics to obtain a complete overview of the evolution of gene dosage on the Z-chromosome of Schistosoma parasites. We compare the Z-chromosome gene content of African (Schistosoma mansoni and S. haematobium) and Asian (S. japonicum) schistosomes and describe lineage-specific evolutionary strata. We use these to assess gene expression evolution following sex-linkage. The resulting patterns suggest a reduction in expression of Z-linked genes in females, combined with upregulation of the Z in both sexes, in line with the first step of Ohno’s classic model of dosage compensation evolution. Quantitative proteomics suggest that post-transcriptional mechanisms do not play a major role in balancing the expression of Z-linked genes. },
  author       = {Picard, Marion A and Cosseau, Celine and Ferré, Sabrina and Quack, Thomas and Grevelding, Christoph and Couté, Yohann and Vicoso, Beatriz},
  journal      = {eLife},
  publisher    = {eLife Sciences Publications},
  title        = {{Evolution of gene dosage on the Z-chromosome of schistosome parasites}},
  doi          = {10.7554/eLife.35684},
  volume       = {7},
  year         = {2018},
}

@article{132,
  abstract     = {Pancreas development involves a coordinated process in which an early phase of cell segregation is followed by a longer phase of lineage restriction, expansion, and tissue remodeling. By combining clonal tracing and whole-mount reconstruction with proliferation kinetics and single-cell transcriptional profiling, we define the functional basis of pancreas morphogenesis. We show that the large-scale organization of mouse pancreas can be traced to the activity of self-renewing precursors positioned at the termini of growing ducts, which act collectively to drive serial rounds of stochastic ductal bifurcation balanced by termination. During this phase of branching morphogenesis, multipotent precursors become progressively fate-restricted, giving rise to self-renewing acinar-committed precursors that are conveyed with growing ducts, as well as ductal progenitors that expand the trailing ducts and give rise to delaminating endocrine cells. These findings define quantitatively how the functional behavior and lineage progression of precursor pools determine the large-scale patterning of pancreatic sub-compartments.},
  author       = {Sznurkowska, Magdalena and Hannezo, Edouard B and Azzarelli, Roberta and Rulands, Steffen and Nestorowa, Sonia and Hindley, Christopher and Nichols, Jennifer and Göttgens, Berthold and Huch, Meritxell and Philpott, Anna and Simons, Benjamin},
  journal      = {Developmental Cell},
  number       = {3},
  pages        = {360 -- 375},
  publisher    = {Cell Press},
  title        = {{Defining lineage potential and fate behavior of precursors during pancreas development}},
  doi          = {10.1016/j.devcel.2018.06.028},
  volume       = {46},
  year         = {2018},
}

@inproceedings{133,
  abstract     = {Synchronous programs are easy to specify because the side effects of an operation are finished by the time the invocation of the operation returns to the caller. Asynchronous programs, on the other hand, are difficult to specify because there are side effects due to pending computation scheduled as a result of the invocation of an operation. They are also difficult to verify because of the large number of possible interleavings of concurrent computation threads. We present synchronization, a new proof rule that simplifies the verification of asynchronous programs by introducing the fiction, for proof purposes, that asynchronous operations complete synchronously. Synchronization summarizes an asynchronous computation as immediate atomic effect. Modular verification is enabled via pending asynchronous calls in atomic summaries, and a complementary proof rule that eliminates pending asynchronous calls when components and their specifications are composed. We evaluate synchronization in the context of a multi-layer refinement verification methodology on a collection of benchmark programs.},
  author       = {Kragl, Bernhard and Qadeer, Shaz and Henzinger, Thomas A},
  issn         = {18688969},
  location     = {Beijing, China},
  publisher    = {Schloss Dagstuhl - Leibniz-Zentrum für Informatik},
  title        = {{Synchronizing the asynchronous}},
  doi          = {10.4230/LIPIcs.CONCUR.2018.21},
  volume       = {118},
  year         = {2018},
}

@article{82,
  abstract     = {In experimental cultures, when bacteria are mixed with lytic (virulent) bacteriophage, bacterial cells resistant to the phage commonly emerge and become the dominant population of bacteria. Following the ascent of resistant mutants, the densities of bacteria in these simple communities become limited by resources rather than the phage. Despite the evolution of resistant hosts, upon which the phage cannot replicate, the lytic phage population is most commonly maintained in an apparently stable state with the resistant bacteria. Several mechanisms have been put forward to account for this result. Here we report the results of population dynamic/evolution experiments with a virulent mutant of phage Lambda, λVIR, and Escherichia coli in serial transfer cultures. We show that, following the ascent of λVIR-resistant bacteria, λVIRis maintained in the majority of cases in maltose-limited minimal media and in all cases in nutrient-rich broth. Using mathematical models and experiments, we show that the dominant mechanism responsible for maintenance of λVIRin these resource-limited populations dominated by resistant E. coli is a high rate of either phenotypic or genetic transition from resistance to susceptibility—a hitherto undemonstrated mechanism we term "leaky resistance." We discuss the implications of leaky resistance to our understanding of the conditions for the maintenance of phage in populations of bacteria—their “existence conditions.”.},
  author       = {Chaudhry, Waqas and Pleska, Maros and Shah, Nilang and Weiss, Howard and Mccall, Ingrid and Meyer, Justin and Gupta, Animesh and Guet, Calin C and Levin, Bruce},
  journal      = {PLoS Biology},
  number       = {8},
  publisher    = {Public Library of Science},
  title        = {{Leaky resistance and the conditions for the existence of lytic bacteriophage}},
  doi          = {10.1371/journal.pbio.2005971},
  volume       = {16},
  year         = {2018},
}

@phdthesis{83,
  abstract     = {A proof system is a protocol between a prover and a verifier over a common input in which an honest prover convinces the verifier of the validity of true statements. Motivated by the success of decentralized cryptocurrencies, exemplified by Bitcoin, the focus of this thesis will be on proof systems which found applications in some sustainable alternatives to Bitcoin, such as the Spacemint and Chia cryptocurrencies. In particular, we focus on proofs of space and proofs of sequential work.
Proofs of space (PoSpace) were suggested as more ecological, economical, and egalitarian alternative to the energy-wasteful proof-of-work mining of Bitcoin. However, the state-of-the-art constructions of PoSpace are based on sophisticated graph pebbling lower bounds, and are therefore complex. Moreover, when these PoSpace are used in cryptocurrencies like Spacemint, miners can only start mining after ensuring that a commitment to their space is already added in a special transaction to the blockchain. Proofs of sequential work (PoSW) are proof systems in which a prover, upon receiving a statement x and a time parameter T, computes a proof which convinces the verifier that T time units had passed since x was received. Whereas Spacemint assumes synchrony to retain some interesting Bitcoin dynamics, Chia requires PoSW with unique proofs, i.e., PoSW in which it is hard to come up with more than one accepting proof for any true statement. In this thesis we construct simple and practically-efficient PoSpace and PoSW. When using our PoSpace in cryptocurrencies, miners can start mining on the fly, like in Bitcoin, and unlike current constructions of PoSW, which either achieve efficient verification of sequential work, or faster-than-recomputing verification of correctness of proofs, but not both at the same time, ours achieve the best of these two worlds.},
  author       = {Abusalah, Hamza M},
  issn         = {2663-337X},
  pages        = {59},
  publisher    = {Institute of Science and Technology Austria},
  title        = {{Proof systems for sustainable decentralized cryptocurrencies}},
  doi          = {10.15479/AT:ISTA:TH_1046},
  year         = {2018},
}

@inproceedings{85,
  abstract     = {Concurrent accesses to shared data structures must be synchronized to avoid data races. Coarse-grained synchronization, which locks the entire data structure, is easy to implement but does not scale. Fine-grained synchronization can scale well, but can be hard to reason about. Hand-over-hand locking, in which operations are pipelined as they traverse the data structure, combines fine-grained synchronization with ease of use. However, the traditional implementation suffers from inherent overheads. This paper introduces snapshot-based synchronization (SBS), a novel hand-over-hand locking mechanism. SBS decouples the synchronization state from the data, significantly improving cache utilization. Further, it relies on guarantees provided by pipelining to minimize synchronization that requires cross-thread communication. Snapshot-based synchronization thus scales much better than traditional hand-over-hand locking, while maintaining the same ease of use.},
  author       = {Gilad, Eran and Brown, Trevor A and Oskin, Mark and Etsion, Yoav},
  issn         = {03029743},
  location     = {Turin, Italy},
  pages        = {465 -- 479},
  publisher    = {Springer},
  title        = {{Snapshot based synchronization: A fast replacement for Hand-over-Hand locking}},
  doi          = {10.1007/978-3-319-96983-1_33},
  volume       = {11014},
  year         = {2018},
}

@unpublished{8547,
  abstract     = {The cerebral cortex contains multiple hierarchically organized areas with distinctive cytoarchitectonical patterns, but the cellular mechanisms underlying the emergence of this diversity remain unclear. Here, we have quantitatively investigated the neuronal output of individual progenitor cells in the ventricular zone of the developing mouse neocortex using a combination of methods that together circumvent the biases and limitations of individual approaches. We found that individual cortical progenitor cells show a high degree of stochasticity and generate pyramidal cell lineages that adopt a wide range of laminar configurations. Mathematical modelling these lineage data suggests that a small number of progenitor cell populations, each generating pyramidal cells following different stochastic developmental programs, suffice to generate the heterogenous complement of pyramidal cell lineages that collectively build the complex cytoarchitecture of the neocortex.},
  author       = {Llorca, Alfredo and Ciceri, Gabriele and Beattie, Robert J and Wong, Fong K. and Diana, Giovanni and Serafeimidou, Eleni and Fernández-Otero, Marian and Streicher, Carmen and Arnold, Sebastian J. and Meyer, Martin and Hippenmeyer, Simon and Maravall, Miguel and Marín, Oscar},
  booktitle    = {bioRxiv},
  publisher    = {Cold Spring Harbor Laboratory},
  title        = {{Heterogeneous progenitor cell behaviors underlie the assembly of neocortical cytoarchitecture}},
  doi          = {10.1101/494088},
  year         = {2018},
}

@inbook{86,
  abstract     = {Responsiveness—the requirement that every request to a system be eventually handled—is one of the fundamental liveness properties of a reactive system. Average response time is a quantitative measure for the responsiveness requirement used commonly in performance evaluation. We show how average response time can be computed on state-transition graphs, on Markov chains, and on game graphs. In all three cases, we give polynomial-time algorithms.},
  author       = {Chatterjee, Krishnendu and Henzinger, Thomas A and Otop, Jan},
  booktitle    = {Principles of Modeling},
  editor       = {Lohstroh, Marten and Derler, Patricia and Sirjani, Marjan},
  pages        = {143 -- 161},
  publisher    = {Springer},
  title        = {{Computing average response time}},
  doi          = {10.1007/978-3-319-95246-8_9},
  volume       = {10760},
  year         = {2018},
}

@article{8618,
  abstract     = {The reversibly switchable fluorescent proteins (RSFPs) commonly used for RESOLFT nanoscopy have been developed from fluorescent proteins of the GFP superfamily. These proteins are bright, but exhibit several drawbacks such as relatively large size, oxygen-dependence, sensitivity to low pH, and limited switching speed. Therefore, RSFPs from other origins with improved properties need to be explored. Here, we report the development of two RSFPs based on the LOV domain of the photoreceptor protein YtvA from Bacillus subtilis. LOV domains obtain their fluorescence by association with the abundant cellular cofactor flavin mononucleotide (FMN). Under illumination with blue and ultraviolet light, they undergo a photocycle, making these proteins inherently photoswitchable. Our first improved variant, rsLOV1, can be used for RESOLFT imaging, whereas rsLOV2 proved useful for STED nanoscopy of living cells with a resolution of down to 50 nm. In addition to their smaller size compared to GFP-related proteins (17 kDa instead of 27 kDa) and their usability at low pH, rsLOV1 and rsLOV2 exhibit faster switching kinetics, switching on and off 3 times faster than rsEGFP2, the fastest-switching RSFP reported to date. Therefore, LOV-domain-based RSFPs have potential for applications where the switching speed of GFP-based proteins is limiting.},
  author       = {Gregor, Carola and Sidenstein, Sven C. and Andresen, Martin and Sahl, Steffen J. and Danzl, Johann G and Hell, Stefan W.},
  issn         = {2045-2322},
  journal      = {Scientific Reports},
  keywords     = {Multidisciplinary},
  publisher    = {Springer Nature},
  title        = {{Novel reversibly switchable fluorescent proteins for RESOLFT and STED nanoscopy engineered from the bacterial photoreceptor YtvA}},
  doi          = {10.1038/s41598-018-19947-1},
  volume       = {8},
  year         = {2018},
}

@article{87,
  abstract     = {Using the geodesic distance on the n-dimensional sphere, we study the expected radius function of the Delaunay mosaic of a random set of points. Specifically, we consider the partition of the mosaic into intervals of the radius function and determine the expected number of intervals whose radii are less than or equal to a given threshold. We find that the expectations are essentially the same as for the Poisson–Delaunay mosaic in n-dimensional Euclidean space. Assuming the points are not contained in a hemisphere, the Delaunay mosaic is isomorphic to the boundary complex of the convex hull in Rn+1, so we also get the expected number of faces of a random inscribed polytope. As proved in Antonelli et al. [Adv. in Appl. Probab. 9–12 (1977–1980)], an orthant section of the n-sphere is isometric to the standard n-simplex equipped with the Fisher information metric. It follows that the latter space has similar stochastic properties as the n-dimensional Euclidean space. Our results are therefore relevant in information geometry and in population genetics.},
  author       = {Edelsbrunner, Herbert and Nikitenko, Anton},
  journal      = {Annals of Applied Probability},
  number       = {5},
  pages        = {3215 -- 3238},
  publisher    = {Institute of Mathematical Statistics},
  title        = {{Random inscribed polytopes have similar radius functions as Poisson-Delaunay mosaics}},
  doi          = {10.1214/18-AAP1389},
  volume       = {28},
  year         = {2018},
}

@phdthesis{9,
  abstract     = {Immune cells migrating to the sites of infection navigate through diverse tissue architectures and switch their migratory mechanisms upon demand. However, little is known about systemic regulators that could allow the acquisition of these mechanisms. We performed a genetic screen in Drosophila melanogaster to identify regulators of germband invasion by embryonic macrophages into the confined space between the ectoderm and mesoderm. We have found that bZIP circadian transcription factors (TFs) Kayak (dFos) and Vrille (dNFIL3) have opposite effects on macrophage germband infiltration: Kayak facilitated and Vrille inhibited it. These TFs are enriched in the macrophages during migration and genetically interact to control it. Kayak sets a less coordinated mode of migration of the macrophage group and increases the probability and length of Levy walks. Intriguingly, the motility of kayak mutant macrophages was also strongly affected during initial germband invasion but not along another less confined route. Inhibiting Rho1 signaling within the tail ectoderm partially rescued the Kayak mutant phenotype, strongly suggesting that migrating macrophages have to overcome a barrier imposed by the stiffness of the ectoderm. Also, Kayak appeared to be important for the maintenance of the round cell shape and the rear edge translocation of the macrophages invading the germband. Complementary to this, the cortical actin cytoskeleton of Kayak- deficient macrophages was strongly affected. RNA sequencing revealed the filamin Cheerio and tetraspanin TM4SF to be downstream of Kayak. Chromatin immunoprecipitation and immunostaining revealed that the formin Diaphanous is another downstream target of Kayak. Immunostaining revealed that the formin Diaphanous is another downstream target of Kayak. Indeed, Cheerio, TM4SF and Diaphanous are required within macrophages for germband invasion, and expression of constitutively active Diaphanous in macrophages was able to rescue the kayak mutant phenotype. Moreover, Cher and Diaphanous are also reduced in the macrophages overexpressing Vrille. We hypothesize that Kayak, through its targets, increases actin polymerization and cortical tension in macrophages and thus allows extra force generation necessary for macrophage dissemination and migration through confined stiff tissues, while Vrille counterbalances it.},
  author       = {Belyaeva, Vera},
  issn         = {2663-337X},
  pages        = {96},
  publisher    = {Institute of Science and Technology Austria},
  title        = {{Transcriptional regulation of macrophage migration in the Drosophila melanogaster embryo }},
  doi          = {10.15479/AT:ISTA:th1064},
  year         = {2018},
}

@article{913,
  abstract     = {Coordinated cell polarization in developing tissues is a recurrent theme in multicellular organisms. In plants, a directional distribution of the plant hormone auxin is at the core of many developmental programs. A feedback regulation of auxin on the polarized localization of PIN auxin transporters in individual cells has been proposed as a self-organizing mechanism for coordinated tissue polarization, but the molecular mechanisms linking auxin signalling to PIN-dependent auxin transport remain unknown. We performed a microarray-based approach to find regulators of the auxin-induced PIN relocation in the Arabidopsis thaliana root. We identified a subset of a family of phosphatidylinositol transfer proteins (PITP), the PATELLINs (PATL). Here, we show that PATLs are expressed in partially overlapping cells types in different tissues going through mitosis or initiating differentiation programs. PATLs are plasma membrane-associated proteins accumulated in Arabidopsis embryos, primary roots, lateral root primordia, and developing stomata. Higher order patl mutants display reduced PIN1 repolarization in response to auxin, shorter root apical meristem, and drastic defects in embryo and seedling development. This suggests PATLs redundantly play a crucial role in polarity and patterning in Arabidopsis.},
  author       = {Tejos, Ricardo and Rodríguez Furlán, Cecilia and Adamowski, Maciek and Sauer, Michael and Norambuena, Lorena and Friml, Jirí},
  issn         = {00219533},
  journal      = {Journal of Cell Science},
  number       = {2},
  publisher    = {Company of Biologists},
  title        = {{PATELLINS are regulators of auxin mediated PIN1 relocation and plant development in Arabidopsis thaliana}},
  doi          = {10.1242/jcs.204198},
  volume       = {131},
  year         = {2018},
}

@article{9229,
  author       = {Danzl, Johann G},
  issn         = {2500-2295},
  journal      = {Opera Medica et Physiologica},
  number       = {S1},
  pages        = {11},
  publisher    = {Lobachevsky State University of Nizhny Novgorod},
  title        = {{Diffraction-unlimited optical imaging for synaptic physiology}},
  doi          = {10.20388/omp2018.00s1.001},
  volume       = {4},
  year         = {2018},
}

@article{691,
  abstract     = {Background: Transport protein particle (TRAPP) is a multisubunit complex that regulates membrane trafficking through the Golgi apparatus. The clinical phenotype associated with mutations in various TRAPP subunits has allowed elucidation of their functions in specific tissues. The role of some subunits in human disease, however, has not been fully established, and their functions remain uncertain.

Objective: We aimed to expand the range of neurodevelopmental disorders associated with mutations in TRAPP subunits by exome sequencing of consanguineous families.

Methods: Linkage and homozygosity mapping and candidate gene analysis were used to identify homozygous mutations in families. Patient fibroblasts were used to study splicing defect and zebrafish to model the disease.

Results: We identified six individuals from three unrelated families with a founder homozygous splice mutation in TRAPPC6B, encoding a core subunit of the complex TRAPP I. Patients manifested a neurodevelopmental disorder characterised by microcephaly, epilepsy and autistic features, and showed splicing defect. Zebrafish trappc6b morphants replicated the human phenotype, displaying decreased head size and neuronal hyperexcitability, leading to a lower seizure threshold.

Conclusion: This study provides clinical and functional evidence of the role of TRAPPC6B in brain development and function.},
  author       = {Marin Valencia, Isaac and Novarino, Gaia and Johansen, Anide and Rosti, Başak and Issa, Mahmoud and Musaev, Damir and Bhat, Gifty and Scott, Eric and Silhavy, Jennifer and Stanley, Valentina and Rosti, Rasim and Gleeson, Jeremy and Imam, Farhad and Zaki, Maha and Gleeson, Joseph},
  issn         = {0022-2593},
  journal      = {Journal of Medical Genetics},
  number       = {1},
  pages        = {48 -- 54},
  publisher    = {BMJ Publishing Group},
  title        = {{A homozygous founder mutation in TRAPPC6B associates with a neurodevelopmental disorder characterised by microcephaly epilepsy and autistic features}},
  doi          = {10.1136/jmedgenet-2017-104627},
  volume       = {55},
  year         = {2018},
}

@article{692,
  abstract     = {We consider families of confocal conics and two pencils of Apollonian circles having the same foci. We will show that these families of curves generate trivial 3-webs and find the exact formulas describing them.},
  author       = {Akopyan, Arseniy},
  journal      = {Geometriae Dedicata},
  number       = {1},
  pages        = {55 -- 64},
  publisher    = {Springer},
  title        = {{3-Webs generated by confocal conics and circles}},
  doi          = {10.1007/s10711-017-0265-6},
  volume       = {194},
  year         = {2018},
}

@inproceedings{6941,
  abstract     = {Bitcoin has become the most successful cryptocurrency ever deployed, and its most distinctive feature is that it is decentralized. Its underlying protocol (Nakamoto consensus) achieves this by using proof of work, which has the drawback that it causes the consumption of vast amounts of energy to maintain the ledger. Moreover, Bitcoin mining dynamics have become less distributed over time.

Towards addressing these issues, we propose SpaceMint, a cryptocurrency based on proofs of space instead of proofs of work. Miners in SpaceMint dedicate disk space rather than computation. We argue that SpaceMint’s design solves or alleviates several of Bitcoin’s issues: most notably, its large energy consumption. SpaceMint also rewards smaller miners fairly according to their contribution to the network, thus incentivizing more distributed participation.

This paper adapts proof of space to enable its use in cryptocurrency, studies the attacks that can arise against a Bitcoin-like blockchain that uses proof of space, and proposes a new blockchain format and transaction types to address these attacks. Our prototype shows that initializing 1 TB for mining takes about a day (a one-off setup cost), and miners spend on average just a fraction of a second per block mined. Finally, we provide a game-theoretic analysis modeling SpaceMint as an extensive game (the canonical game-theoretic notion for games that take place over time) and show that this stylized game satisfies a strong equilibrium notion, thereby arguing for SpaceMint ’s stability and consensus.},
  author       = {Park, Sunoo and Kwon, Albert and Fuchsbauer, Georg and Gazi, Peter and Alwen, Joel F and Pietrzak, Krzysztof Z},
  booktitle    = {22nd International Conference on Financial Cryptography and Data Security},
  isbn         = {9783662583869},
  issn         = {1611-3349},
  location     = {Nieuwpoort, Curacao},
  pages        = {480--499},
  publisher    = {Springer Nature},
  title        = {{SpaceMint: A cryptocurrency based on proofs of space}},
  doi          = {10.1007/978-3-662-58387-6_26},
  volume       = {10957},
  year         = {2018},
}