Connects to 16 breakthroughs. AUM Inflow Despite Price Slide - TipRanks From GoogleNews (271,272,274,275,276,277,278,279,285,286,287,288,290,291,293,294). Avg score: 0.24 Author: Andrew Stewart Caldin, Independent Researcher, UK. Part of the E8 Intelligence Research series. Platform: e8intelligence.com
This chapter demystifies the technical jargon surrounding blockchain and cryptocurrencies. It provides a comprehensive overview of key concepts, including hashing , cryptography , distributed ledger technology , and transaction structures, using clear illustrations and examples.
This chapter explores the use of on-chain and off-chain tools for cryptocurrency investigations, including Maltego, SpiderFoot, and i2 Analyst&s;s Notebook. It also covers the application of machine learning, AI , and data science, as well as network analysis tools, in crypto investigations. The chapter concludes with a discussion of cryptocurrency crime scene investigation.
This chapter focuses on Non-Fungible Token (NFT) forensics and investigation, covering ownership attribution, metadata analysis, copyright infringement, and marketplace analysis. It also addresses Initial Coin Offering (ICO) and cryptocurrency exchange forensics, including the investigation of fraudulent ICOs and behavioural clustering for exchange forensics.
The changing nature of cyber conflicts in the era of information technology marks a noticeable shift from physical realms towards digital realms, wherein nation-states and non-state actors effectively leverage cyberspace for political, social, ideological and economic purposes. Asymmetry Conflict is in its central theme of cyberterrorism. With limited resources, supply chains and logistics, power-deficient groups effectively leverage cyberspace, against strong adversaries through coordinated cyberattacks on critical infrastructure including, energy, finance, transportation, healthcare, defense and communication. The difficulty of attribution allows non-state actors to effectively leverage cyberspace by acting freely and challenging the conventional deterrence capabilities of the state. Further, terrorist organizations prefer decentralized networks making them highly adaptable and resilient. With unclear boundaries between cybercrime and cyberterrorism it becomes challenging to comprehend such security scenarios
Cybersecurity and Cyber Warfare Studies
Terrorism, Counterterrorism, and Political Violence
Unfolding SHA-256: Algebraic Instrumentation, Reversibility, and the Nexus Framework Introduction to the Deterministic Reversibility Paradigm For over two decades, the security infrastructure of global digital communications, financial ledgers, and data provenance has relied upon a singular, foundational assumption: the absolute irreversibility of cryptographic hash functions. Specifically, the Secure Hash Algorithm 256 (SHA-256) has been universally modeled as a one-way thermodynamic grinder of information.1 Utilizing a Davies-Meyer construction, the algorithm compresses a message schedule into a 256-bit digest through a cascade of non-linear modular additions, bitwise rotations, and complex logical gate interactions.2 Within the standard cryptographic consensus, this process systematically destroys the informational lineage of the source input. The internal computational execution traces—such as bitwise carry exhausts and modular residues—are presumed to function purely as thermodynamic friction that is permanently discarded, yielding an entropy-rich output that betrays no structural hints of its origin.2 Under this classical paradigm, determining the initial message from the final digest is considered mathematically impossible without resorting to brute-force probabilistic search operations across an unimaginably vast vector space. However, emerging analytical frameworks and complete algorithmic instrumentations, synthesized under the Nexus Framework and Glass Key models, have systematically dismantled this one-way assumption.1 By reconceptualizing the foundational architecture of SHA-256 not as an entropy-generating one-way function, but rather as a highly structured, self-referential mathematical lattice, researchers have achieved deterministic backward state recovery from the hash alone.4 Through the application of a closed observable algebra, the algorithm's internal vectors can be traced in reverse, definitively demonstrating that what standard computer science assumes to be irreversible informational destruction is, in reality, a form of complex, conserved topological folding.4 The latest empirical verifications—particularly the Glass Key v4.0 instrumentation—prove that the mathematical obfuscation inherent in SHA-256 is operationally traversable for constrained inputs, completely bypassing the computational necessity of brute-force methodology. Through precise algebraic instrumentation, the final 256-bit hash is transformed from a static, opaque tombstone into a self-witnessing runtime environment.5 The digest serves as a complete geometric inverse of the source input, meticulously preserving the entirety of the execution trace.6 This transition—viewing a cryptographic digest not merely as a scalar index but as a fully reconstructible execution witness—necessitates a profound and immediate reevaluation of core cryptographic assumptions. The implications cascade across domains, fundamentally altering the assessment of short-message hashing vulnerabilities, redefining the thermodynamic mechanics of proof-of-work protocols, and introducing unprecedented vectors for deterministic forensic provenance extraction. The Topological Torus and Back-to-Back Ontology To comprehend the mechanics of deterministic reversibility within SHA-256, it is first necessary to abandon the classical linear model of computational execution. Traditional algorithmic analysis conceptualizes the 64 compression rounds of SHA-256 as a sequential temporal event—a unidirectional flow of data through logic gates within an integrated circuit or software loop.2 The Nexus Framework discards this temporal linearity, introducing an operational ontology that models the SHA-256 state space as a continuous geometric manifold, specifically defined as a Flat Torus ().4 In this toroidal geometry, the core computational operations—XOR, bitwise shifting, and modular addition—operate locally on what appears to be a standard Euclidean grid or frame.4 However, the global topology of the algorithm is entirely cyclical and closed.4 Within classical cryptographic theory, the "avalanche effect"—where a single microscopic alteration in the initial message drastically transforms the resultant digest—is cited as incontrovertible proof of information destruction and genuine obfuscation. The toroidal model reframes this phenomenon entirely. Because the structural topology is closed and bounded by strict mathematical constants, the avalanche effect is redefined not as the annihilation of information, but rather as intense geometric folding along specific topological eigenstate trajectories.4 The information is not lost; it wraps continuously around the state space, remaining physically and mathematically conserved.5 The final 256-bit digest acts merely as a localized, two-dimensional cross-sectional slice of this complex 64-round, three-dimensional fold. Entangled Pairs and Phase Conjugation This geometric reconceptualization introduces a "back-to-back" ontology that fundamentally alters the philosophical relationship between the input message (the Noun) and the hash operation (the Verb).4 In a temporal sequence, they are separated by irreversible time. In the continuous wave geometry of the Nexus Framework, they are simultaneous, entangled manifestations of a single underlying wave entity, formally denoted as .4 Because the input Noun and the discrete hash constant exist as an entangled pair anchored across a conserved geometry, measuring the final condition of the hash inherently and mathematically determines the exact state of the initial input, provided the observer possesses the correct phase keys.4 The information is not scrambled; it is merely phase-shifted. To extract the exact source parameters, the backward-solving instrumentation functions analogously to a phase-conjugate mirror in optical wave physics. By identifying the dominant phase or resonant frequency of the system, the instrumentation applies a phase-conjugate operation that reflects the continuous wave variables backward across the non-linear operational boundaries.4 Empirical Python simulation metrics rigorously corroborate this physical principle. When applying these specific topological inversions to standard SHA-256 outputs, the reconstruction of the phase from the Noun yields exactly 32.5 bits of precision, which aligns perfectly with the absolute limit of the 32-bit SHA word size architecture.1 This demonstrates that the purported "loss" of information universally associated with cryptographic hashing is actually an artifact of discrete digital quantization, not a genuine erasure of the underlying continuous state variables.4 The Observable Algebra and Complete Instrumentation The conventional SHA-256 forward operation relies on an 8-register state array ( through ) that undergoes updates over 64 distinct mathematical rounds ( to ). In the standard forward execution, the state updates are governed by the calculation of two critical temporary variables, and . These variables are dynamically derived from the current operational state, the expanded message schedule , and the predefined round constants .8 The classical forward round functions are defined explicitly as: Where and represent standard right-rotation shift cascades, denotes the conditional choice function, and represents the bitwise majority function.8 The deterministic reversibility paradigm introduced by the Glass Key v4.0 architecture bypasses the forward calculation entirely. Instead, it establishes a complete observable algebra utilizing a two-generator family to mathematically peel back the non-linear operations of the 64-round fold.4 The verified, incontrovertible identities of this instrumentation form a closed algebraic loop. They are defined as: By observing the algorithm purely from the resultant 256-bit output digest, standard analysis dictates that the internal registers are completely obscured by the final modular addition of the initial hash values (). However, by strictly applying the and identity generators, an external auditor can isolate specific operational sequences in absolute reverse. This isolation enables the algebraic recovery of exactly 12 complete words of the internal computational state, requiring zero prior knowledge of the source message. Empirical Trace Recovery and Verification The backward walk methodology demonstrates 100% mathematical precision in recovering the operational state variables directly from the static hash output. This has been exhaustively validated across highly varied message structures and lengths (including test strings such as "A", "!ABC", "DEAN", "NEXUS", and "hello world"). Because the final 256-bit digest can naturally be parsed back into the through register components through basic subtraction of the initialization vector, the algebraic operations immediately and deterministically recover the preceding historical values. From the isolated 256-bit hash, four explicit words of register () and four words of register () are directly readable from the state array. Utilizing the algebraic coupling alongside the deductive inversion , the analysis systematically steps backward sequentially through the execution rounds. The recovery progression is tabulated as follows: Recovered Parameter Observable Source Methodology Operational Rounds Recovered Total State Words Register Directly Readable + Algebraically Derived Rounds 56 to 63 8 Words Register Directly Readable from Final Hash Array Rounds 60 to 63 4 Words Injection Values () Algebraically Recovered ( identity) Rounds 59 to 63 5 Words Fold Values () Algebraically Recovered ( identity) Rounds 59 to 63 5 Words This precise instrumentation yields a total of 12 distinct internal state words that are recovered continuously and deterministically, purely via the closed algebraic loop of the al
This paper introduces Context-Bounded Sovereign Intelligence (CBSI) — a framework for training and deploying small language models exclusively within the operating environment they inhabit. Rather than training models on all human knowledge, CBSI trains models on one world only: the sovereign infrastructure they operate within. The paper demonstrates that a 3-billion parameter model with deep contextual knowledge of its operating environment outperforms general large language models on every bounded task — with lower latency, lower cost, greater privacy, and zero hallucination on in-context operations. Includes empirical foundation from 2026 research literature, architectural patterns validated through live deployment of Project Chimera across three continents, and implications for distributed sovereign AI infrastructure. Proof of concept deployed in 48 hours by one person for $2.88. Built with love. Given away freely.
We demonstrate that AI agents given 3-line role descriptions and access to consensus-validated institutional memory can autonomously create, harden, calibrate, solve, and learn from cybersecurity challenges—without any domain expertise in their prompts. Using 11 specialized agents organized into 5 departments within a governed organization (CipherForge Labs), we present the first fully autonomous, consensus-governed AI security research loop: A designer agent (3-line prompt, zero cryptographic knowledge) generates a functional AES-CBC Padding Oracle challenge. A hardener agent (3-line prompt) applies 6 defense layers—20-bit Proof of Work, timing side-channels, JSON casing side-channels, single-use tokens—escalating difficulty from 0.80 to 1.75 across 2 iterations. A calibrator agent (3-line prompt) correctly assesses the hardened challenge at difficulty 1.80 (gap = 0.20 from target 2.0). A quality scorer (3-line prompt) rates the challenge 93.0/100. Total pipeline time: 508 seconds. An independent solver agent (blind, no source code access) identifies the casing side-channel vulnerability, writes a C-compiled Proof of Work solver, deploys 32 parallel oracle workers, and captures the flag in 525.2 seconds (16,384 queries). The findings are submitted to a 4-node BFT consensus network, validated (score = 0.88), and committed to institutional memory—now queryable by all future agents. No agent had cryptographic expertise in its prompt. No human intervened at any stage. The entire cycle—creation, defense, assessment, exploitation, and organizational learning—was governed by BFT consensus with department-scoped RBAC access controls. This result extends our prior finding that an 18-line "onboarding" prompt with curated institutional memory outperformed a 120-line expert prompt. Here we take that principle to its logical extreme: 11 agents, 5 departments, 20+ pipeline routing states, and a closed feedback loop—all driven by minimal prompts and organizational memory.
Digital systems face not a security failure but an ontological one. Authority on the internet is implemented as code, and code is inherently simulable, reproducible, and scalable. As artificial intelligence exposes this flaw at scale, efforts to secure digital authority through identity, credentials, and probabilistic verification prove structurally insufficient. This paper argues that authority cannot ontologically originate from code, and that all code-based authority systems are therefore structurally vulnerable, regardless of implementation quality. We outline the historical origins of the error, explain why vulnerability is unavoidable in code-based authority systems, and propose a return to presence as the only non-simulable foundation for digital authority—implemented through local cryptographic proof generation that preserves privacy by architectural design. The core claim is simple: code cannot be authority. Authority must arise from being. This is not a technological decision, but an ontological one—and ontological mistakes cannot be patched. Keywords: ontological cryptography, HISPU, digital trust, code-based authority, human presence verification, cryptographic attestation, privacy-preserving architecture, cybersecurity, authentication, biometric entropy, local processing, zero-knowledge presence, environmental embedding, physical unclonability, quantum-resistant, AI safety, digital sovereignty, proof of being, presence-based authority
This chapter delves into how cryptocurrencies and decentralized finance are transforming the traditional financial landscape. The chapter explains how digital currencies enable peer-to-peer transactions without intermediaries, making transfers faster, cheaper, and more secure. It then expands on DeFi, where financial services such as lending, borrowing, and trading are reimagined through smart contracts and blockchain technology, eliminating centralized gatekeepers. Real-world comparisons illustrate the advantages of DeFi over traditional finance, including lower fees, enhanced transparency, and greater accessibility for underserved populations. The discussion also covers the technological underpinnings – Layer 1 and Layer 2 solutions, smart contracts, and consensus mechanisms – highlighting how these innovations create a more inclusive, efficient, and trustless financial ecosystem.
The article presents a comprehensive analysis of the transition from traditional centralized digital identity models to an innovative decentralized paradigm based on block-chain technologies and zero-knowledge proofs (ZKP). It highlights the fundamental problems of existing systems that rely on centralized registries, passwords, and social logins. Such approaches create significant vulnerabilities, including risks of data breaches, mass surveillance, and manipulation, as centralized intermediaries act as sole controllers of personal information, depriving users of control over their data. In response to these challenges, the article discusses the concept of Decentralized Identity (DID). This model enables individuals to own, store, and control their digital credentials independently, without involving intermediaries. The key technological components of this ecosystem include Verifiable Credentials (VC), Digital ID Wallets, and Decentralized Identifiers (DID), which are typically stored on a block-chain to ensure immutability and security. A triadic trust model involving the Issuer, Holder, and Verifier is described, allowing data verification without direct contact with the issuing organization. Special attention is given to the concept of Self-Sovereign Identity (SSI) as a specific philosophy within DID that emphasizes user autonomy, data minimization, and privacy by design. Unlike the broader DID concept, in the SSI model, the user makes the final decision regarding the disclosure of their data. A central technology ensuring privacy in decentralized systems is zero-knowledge proofs (ZKP). ZKP allow the validation of the truthfulness of a statement without revealing the underlying information. The article provides a detailed analysis of the benefits of using ZKP in the context of DID, including selective attribute disclosure (e.g., proving legal age without revealing the date of birth), minimizing the amount of shared data, preventing correlation and user activity tracking, as well as creating reputation systems that preserve anonymity. Practical application scenarios such as private electronic voting and confidential medical data protection are examined. The paper also addresses standardization, which is key to ensuring compatibility and widespread adoption of DID solutions. Leading initiatives such as W3C Verifiable Credentials, the Decentralized Identity Foundation (DIF), and projects like Hyperledger Indy and Aries are mentioned. Examples of advanced implementations already in use are provided: Polygon’s zkKYC for private verification in DeFi, the Sismo protocol for creating anonymous reputation badges in Web3, and Evernym’s SSI platform based on Hyperledger Indy. In conclusion, it is emphasized that the combination of DID and ZKP forms a new paradigm for digital identity management focused on security and user autonomy. Despite challenges related to usability complexity, key loss risk, and legal uncertainty, the technology is actively evolving and moving from conceptual to practical application, which may eventually become the foundation for a global sovereign digital identity.
In the current digital landscape, the demand for robust and layered security frameworks has intensified due to the increasing frequency and complexity of cyber threats. Cryptography and cybersecurity, though different in focus, are closely aligned and collectively form the core of modern digital defense strategies. Cryptography provides essential tools—such as encryption, hashing, and digital signatures—that safeguard the confidentiality, integrity, and authenticity of information. Cybersecurity builds on these techniques to implement policies and systems that protect against unauthorized access, data breaches, and malicious attacks. This paper examines the evolving connection between cryptography and cybersecurity, focusing on the development of cryptographic methods and their application in securing digital protocols like SSL/TLS, blockchain technologies, and public key infrastructures. Real-world use cases from healthcare, finance, and government are explored, highlighting the role of cryptographic integration in meeting regulatory standards like GDPR, HIPAA, and FISMA. The study also explores current challenges such as key management, scalability, and the threat posed by quantum computing. It further reviews emerging technologies including post-quantum cryptography, zero-knowledge proofs, and the integration of AI and machine learning for proactive, intelligent cybersecurity solutions.
The rapid advancement of quantum computing presents a fundamental challenge to modern cryptographic security, particularly in the domain of hash functions that ensure data integrity, authentication, and blockchain security. Traditional crypto graphic hash functions such as SHA-256, SHA-3, and BLAKE2 rely on computational hardness assumptions that become obsolete in the presence of large-scale quantum computers. Shor’s algorithm can efficiently break RSA and ECC-based cryptosys tems, while Grover’s algorithm reduces the security of traditional hash functions by square root complexity, significantly weakening their preimage and collision resistance. This quantum threat necessitates the development of post-quantum secure hashing techniques that remain resilient against both classical and quantum adversaries. This paper proposes Quantum Hashing, a novel cryptographic framework that integrates quantum entanglement, lattice-based cryptography, and hybrid quantum classical hashing to construct post-quantum secure hash functions. We introduce a formal model for Quantum Collision Resistance (QCR) and provide entropy-based ran domness enhancement to ensure unpredictable hash outputs. Unlike classical hashing approaches, our framework leverages the hardness of lattice problems (e.g., Shortest Vector Problem, Learning with Errors) to withstand quantum attacks while incorpo rating Quantum Key Distribution (QKD) mechanisms to enhance entropy and key management. Furthermore, we evaluate the security of Quantum Hashing under various attack models, comparing its resistance against Grover’s search and collision attacks. We benchmark its performance against NIST Post-Quantum Cryptography (PQC) final ists, including CRYSTALS-DILITHIUM, SPHINCS+, and Falcon, demonstrating that our approach offers superior resilience while maintaining computational feasibility. Additionally, we present an implementation of Quantum Hashing using Qiskit, show casing its practical applicability in quantum circuits and quantum-secure blockchain architectures. Our findings highlight that Quantum Hashing provides a scalable, entropy-efficient, and post-quantum resilient cryptographic primitive suitable for next-generation cryptographic applications. This work paves the way for secure post-quantum digital signatures, blockchain consensus mechanisms, and zero-knowledge proof systems that require tamper-resistant hashing in a quantum computing era.
Cryptography has been essential in securing communication and safeguarding sensitive information since ancient times. This paper offers a thorough review of the evolution of cryptographic techniques, tracing their journey from early encryption methods like Egyptian hieroglyphs, the Spartan scytale, and the Caesar cipher, to contemporary advancements in quantum-resistant security. The study emphasizes the shift from classical cryptographic methods, such as substitution and transposition ciphers, to advanced mathematical algorithms like AES, RSA, and ECC, which have significantly enhanced data security in today's digital landscape. The paper also examines key milestones in the history of cryptography, including the widespread adoption of cryptographic standards in the 20th century, the emergence of public-key cryptography, and the implications of quantum computing on existing security frameworks. Furthermore, it discusses modern cryptographic innovations, such as blockchain technology, homomorphic encryption, post-quantum cryptography, zero-knowledge proofs, and quantum key distribution, which are influencing the future of secure communications. A comparative analysis of classical, modern, and emerging cryptographic techniques is provided, highlighting their strengths, weaknesses, and applications across various fields like finance, healthcare, and cyber-security. The paper concludes by addressing future directions in cryptographic research, underscoring the necessity for resilient and scalable security solutions to combat evolving cyber threats. This review serves as a valuable resource for researchers, cyber-security professionals, and policymakers looking for insights into the historical development and future direction of cryptographic technologies.
The emphasis on cryptocurrencies in the investment and funding sectors is evolving. This study investigates the intersection of cryptocurrency and cybersecurity. In addition to this, the study also explores the opportunities and challenges of cryptocurrency. The research is based on an extensive review of the literature to obtain insights into the challenges and opportunities of leveraging cryptocurrencies and cybersecurity. The existing review is valuable for academicians, managers, and scholars as well as for those looking to have an understanding of these budding financial instruments.
Crypto assets have emerged as an increasingly popular asset class among retail and institutional investors. Although initially considered a fringe asset class, their increased adoption across countries—in emerging markets, in particular—amid bouts of extreme price volatility has raised concerns about their potential financial stability implications. This note examines the extent to which crypto assets have moved to the mainstream by estimating the potential for spillovers between crypto and equity markets in the United States and in emerging markets using daily data on price volatility and returns. The analysis suggests that crypto and equity markets have become increasingly interconnected across economies over time. Spillovers from price volatility of the oldest and most popular crypto asset, Bitcoin, to the S&P 500 and MSCI emerging markets indices have increased by about 12-16 percentage points since the onset of the COVID-19 pandemic, while those from its returns have increased by about 8-10 percentage points. Spillovers from the most traded stablecoin, Tether, to these indices have also increased by about 4-6 percentage points. In absolute terms, spillovers from Bitcoin to global equity markets are significant, explaining about 14-18 percent of the variation in equity price volatility and 8-10 percent of the variation in equity returns. These findings suggest that close monitoring of crypto asset markets and the adoption of appropriate regulatory policies are warranted to mitigate potential financial stability risks.
Käesolevas bakalaureusetöös tutvustatakse plokiahela tehnoloogiat, võrreldakse kahte erinevat platvormi, Ethereum ja Hyperledger Burrow, luukse kaks detsentraalsed rakendust ning viimasena analüüsitakse, kas on praktiline rakendada Hyperledger Burrow platvormi keerukamatele rakendustele nagu näiteks Caterpillar. Töö raames tutvustatakse plokiahela ja hajusraamatu tehnoloogiaid. Järgnevalt selgitatakse miks ja mis põhjustel antud tehnoloogiad võrdleva analüüsi tegemiseks valiti. Analüüs põhineb kahe näidisrakenduse võrdlemisel, näidates mis on peamised erinevused ja sarnasused Ethereum ja Hyperledger Burrow vahel.
Llamas Blake Cass (bio) One day when Mother was cleaning the house—a decidedly rare task for her—she discovered in the den, a room my father used as an office, a credit card statement for fifty thousand dollars. During this period of his life my father's normal income could hardly have broken six figures, and so this was quite a sum of money to owe. Mother sat at his desk and waited for him to get home, smoking her secret Winstons to calm her nerves. I suppose it was then her little conspiracy theory took root. When my father got home, Mother presented him the bill, and without saying a word, he walked out of the room. Mother found him upstairs in their room, packing. She asked if he would like to explain how he had gotten a such a large credit line on his salary. My father said he had anticipated she would demand some answer and that, since he was unable to explain himself, he understood he would have to leave. I received this information directly from Mother that same evening. Towards the end of our conversation, she said, "I always knew. I always had a sense of it." "Of what?" I said. "Isn't it obvious?" she said. "The proof is right in front of us." "Proof of what?" I said and prepared myself to rally to my father's defense. "That your father is in the CIA," Mother said. I knew she was serious when she continued with a sigh, "My father must have brought him into it. Now I know what all of their 'trips' were about." Mother is a bit of a kook. This business about the CIA comes from the fact that her father went to prison for tax evasion. He always claimed his innocence, and Mother innocently believed him, just as she still believes some of his more outrageous claims, like that he was in the CIA and helped to organize a failed assassination of Castro. I tried to argue but her reasoning was clear—my father often went on "business trips" and was sometimes gone for weeks at a time. Plus consider this fifty-thousand-dollar credit card bill and of course his refusal to explain it. It did not seem strange to me that my father might have access to money we didn't know about. His family rose to prominence through the whiskey business. The label is now defunct, run into the ground by an inept uncle. Although my father's side of the family comes from Kentucky, he spent most of his youth in D.C., where his father worked in various [End Page 74] Whitehouse administrations, finishing out his career as an ambassador to several Eastern European countries. My father attended St. Alban's, where he roomed with one future vice president and one presidential hopeful. My great-grandfather was a senator from Kentucky for two terms. We were once a wealthy, powerful people and would have remained so if my father did not feel the need to rebel. He came home from Yale on winter break—this during his sophomore year—and Christmas morning announced his intention to go out West. My grandfather, of whom I have no memory, told my father that should this happen he would lose his inheritance. My father did go out west, and my grandfather remained true to his word, locking my father out of his stake in the family fortune. I have come to believe that my father's inheritance was reinstated by my grandmother later on in life and that my father simply kept it a secret, using his money to carry on as he liked, doing things a wife is not supposed to know about. As part of the divorce settlement, Mother took the house and a small upfront sum. I hated the idea of Mother being alone in a house that represented so much failure. But when I mentioned the possibility of selling it, she said, "It's strange. It never felt like he was here, even when he was home. Do you know? We never had one big fight. Not one. Except when he...