<?xml version="1.0" encoding="UTF-8"?><rss xmlns:dc="http://purl.org/dc/elements/1.1/" xmlns:content="http://purl.org/rss/1.0/modules/content/" xmlns:atom="http://www.w3.org/2005/Atom" version="2.0" xmlns:cc="http://cyber.law.harvard.edu/rss/creativeCommonsRssModule.html">
    <channel>
        <title><![CDATA[Stories by Miftahul Arifin on Medium]]></title>
        <description><![CDATA[Stories by Miftahul Arifin on Medium]]></description>
        <link>https://medium.com/@arifintahu?source=rss-4dcc9c79c93------2</link>
        <image>
            <url>https://cdn-images-1.medium.com/fit/c/150/150/2*2RqkX2j-lpSpHsa4Mcp3rA.jpeg</url>
            <title>Stories by Miftahul Arifin on Medium</title>
            <link>https://medium.com/@arifintahu?source=rss-4dcc9c79c93------2</link>
        </image>
        <generator>Medium</generator>
        <lastBuildDate>Wed, 18 Nov 2026 02:40:53 GMT</lastBuildDate>
        <atom:link href="https://medium.com/@arifintahu/feed" rel="self" type="application/rss+xml"/>
        <webMaster><![CDATA[yourfriends@medium.com]]></webMaster>
        <atom:link href="http://medium.superfeedr.com" rel="hub"/>
        <item>
            <title><![CDATA[How Reentrancy Exploits Drain Smart Contracts]]></title>
            <link>https://arifintahu.medium.com/how-reentrancy-exploits-drain-smart-contracts-5fcd963e35a6?source=rss-4dcc9c79c93------2</link>
            <guid isPermaLink="false">https://medium.com/p/5fcd963e35a6</guid>
            <category><![CDATA[solidity]]></category>
            <category><![CDATA[blockchain]]></category>
            <category><![CDATA[reentrancy]]></category>
            <category><![CDATA[smart-contract-security]]></category>
            <dc:creator><![CDATA[Miftahul Arifin]]></dc:creator>
            <pubDate>Sat, 24 Jan 2026 02:52:30 GMT</pubDate>
            <atom:updated>2026-01-24T02:52:30.040Z</atom:updated>
            <content:encoded><![CDATA[<p>How can a simple callback become a catastrophic vulnerability? In 2016, The DAO attack answered this question with brutal clarity: a recursive exploit drained $60 million in ETH, forcing Ethereum into a controversial hard fork. This wasn’t the last time — from Uniswap’s $25M loss in 2020 to Cream Finance’s $18.8M exploit in 2021, reentrancy attacks have repeatedly proven that <strong>security is not a feature; it is the structure of your logic.</strong></p><h4><strong>The Problem: Agreement in the Face of State Manipulation</strong></h4><p>Reentrancy is fundamentally a race condition. The vulnerability lies not in the code that runs, but in the code that <em>awaits</em> to run during state updates. When a smart contract controls to an external address before finalizing its state changes, that external code can recursively call back into the original contract, exploiting the temporal gap between execution and state commitment.</p><p>Think of it as a bank teller handing you cash before writing the withdrawal in the ledger. If you can ask for the cash again before the pen hits the paper, the bank is drained.</p><h4><strong>The Core Concept: The State Gap</strong></h4><figure><img alt="" src="https://cdn-images-1.medium.com/max/1024/1*ZThRXaYHEF1AxWj5gQwZLg.jpeg" /></figure><p>At its heart, reentrancy exploits the temporal window between three critical phases: <strong>Execution Start</strong> (when an external call is made), <strong>The Attack Vector</strong> (the race condition window where the attacker can re-enter), and <strong>State Update</strong> (when the ledger is finally written). The vulnerability exists precisely in this gap — the moment between handing over control and committing the state change.</p><p><strong>The Bank Teller Analogy:</strong></p><p>Imagine a teller hands you cash (Interaction) before writing the withdrawal in the ledger (Effect). If you can ask for the cash again before the pen hits the paper, the bank is drained.</p><p><strong>Technical Definition:</strong></p><p>Reentrancy is a race condition where the vulnerability exists not in the executing code, but in the code that <em>await()</em> waits to run (the state update). The exploit occurs during the state gap when:</p><p>1. Control is handed to an external contract (Interaction)</p><p>2. That contract calls back before state changes are finalized</p><p>3. The original contract operates on stale state</p><h4><strong>Anatomy of the Loop</strong></h4><p>Here’s the vulnerable pattern that has cost the ecosystem hundreds of millions:</p><pre>// Vulnerable Contract<br>function withdraw(uint amount) public {<br>    require(balances[msg.sender] &gt;= amount);<br>    msg.sender.call{value: amount}(&#39;&#39;); // [A] Control Handed Over<br>    <br>    balances[msg.sender] -= amount;     // [B] Executed Too Late<br>}</pre><p><strong>The Attack Sequence:</strong></p><p>1. Attacker calls <em>withdraw()</em></p><p>2. Victim sends ETH to attacker’s contract</p><p>3. Attacker’s fallback triggers, calling <em>withdraw()</em> again</p><p>4. Recursive calls continue while <em>balance &gt; 0</em></p><p>5. Victim updates balance only after recursion completes</p><p>This creates a destructive loop where each iteration drains funds before the ledger reflects the withdrawal.</p><h4><strong>Attack Patterns: Shared State Vectors</strong></h4><p>Reentrancy attacks can be categorized by how they exploit shared state within a contract. These “shared state vectors” represent the most common attack surfaces where a single contract’s internal variables become the target.</p><p><strong>Mono-Function Reentrancy</strong></p><p>This is the simplest and most well-known form of reentrancy. The attacker exploits a single function by calling it recursively before the first invocation completes. Since the function’s state update (like zeroing a balance) hasn’t happened yet, each recursive call sees the original, unchanged state.</p><p><strong>Why it works:</strong> The function sends ETH (or makes an external call) before updating its internal records. The attacker’s receiving contract has a <em>fallback()</em> or <em>receive()</em> function that immediately calls <em>withdraw()</em> again.</p><pre>function withdraw() {<br>    // Attacker recursively calls this same function<br>    // before it completes execution<br>}</pre><p><strong>Cross-Function Reentrancy (The Side Door)</strong></p><figure><img alt="" src="https://cdn-images-1.medium.com/max/1024/1*tYsNycY9Z3k0CUnwcN112g.jpeg" /></figure><p>This is a more sophisticated attack where the attacker doesn’t re-enter the same function — instead, they call a <em>different</em> function that shares the same state variables. Developers often add reentrancy protection to obvious functions like <em>withdraw()</em> but forget that other functions like <em>transfer()</em> can also manipulate the same balance.</p><p>While <em>withdraw()</em> is paused mid-execution waiting for the external call to complete, <em>all other public functions remain callable</em>. If any of those functions read or write the same state variables, the attacker can exploit the inconsistent state.</p><pre>contract VulnerableContract {<br>    mapping(address =&gt; uint) balances;<br>    <br>    function withdraw() public {<br>        uint amount = balances[msg.sender];<br>        (bool success,) = msg.sender.call{value: amount}(&#39;&#39;);<br>        balances[msg.sender] = 0;<br>    }<br>    <br>    function transfer(address to, uint amount) public {<br>        // Shares the same balance variable!<br>        require(balances[msg.sender] &gt;= amount);<br>        balances[to] += amount;<br>        balances[msg.sender] -= amount;<br>    }<br>}</pre><p><strong>Attack scenario:</strong> An attacker with 10 ETH balance calls <em>withdraw()</em>. Before the balance is zeroed, the attacker’s fallback function calls <em>transfer() </em>to move those same 10 ETH to a collaborator address. Now the attacker has received 10 ETH and transferred 10 ETH — doubling their money.</p><h4><strong>Attack Patterns: Composability Threats</strong></h4><p>Modern DeFi protocols don’t exist in isolation — they’re composed of multiple interacting contracts. This composability creates new attack surfaces where reentrancy guards on individual contracts may be insufficient because the attack path spans multiple contract boundaries.</p><p><strong>Cross-Contract Reentrancy</strong></p><figure><img alt="" src="https://cdn-images-1.medium.com/max/1024/1*AWFKYm8v2PZtSgJGSar1Gw.jpeg" /></figure><p>This attack exploits the relationship between two or more contracts that share state or have trust relationships. Even if Contract A has a perfect reentrancy guard, an attacker can bypass it by re-entering through Contract B — which may have access to modify the same shared state or call privileged functions on Contract A.</p><p><strong>Real-world example:</strong> A vault contract (A) stores user deposits, while a strategy contract (B) invests those funds. Both contracts can update the vault’s total balance. An attacker triggers a withdrawal from the vault, and during the external call, re-enters through the strategy contract to manipulate the balance calculation.</p><p><strong>Why standard guards fail:</strong> OpenZeppelin’s <em>ReentrancyGuard </em>uses a contract-local storage variable. If Contract B doesn’t inherit from the same guard instance or check Contract A’s lock status, the protection is bypassed entirely.</p><p><strong>Read-Only Reentrancy (The Silent Killer)</strong></p><figure><img alt="" src="https://cdn-images-1.medium.com/max/1024/1*GOJSl-Ly096Mo4NowAvqoQ.jpeg" /></figure><p>This is the most insidious form of reentrancy because <strong>no state is modified</strong> during the attack — yet it still causes massive financial damage. The attacker exploits the fact that <em>view functions</em> can be called during the state gap, returning stale or manipulated data that other protocols trust and act upon.</p><p><strong>How it works:</strong> During a legitimate operation (like removing liquidity from a pool), there’s a moment when tokens have been burned but ETH hasn’t been sent yet. At this instant, the pool’s reserves appear artificially high relative to the token supply, inflating the perceived price. If a lending protocol queries this price during the callback, it will issue loans based on the manipulated valuation.</p><p><strong>Why it’s so dangerous:</strong></p><ul><li>Traditional reentrancy guards don’t help because no state is being written</li><li>The victim isn’t the contract being re-entered — it’s a third-party protocol reading bad data</li><li>Auditors often overlook view functions as “safe”</li></ul><p><strong>Notable victims:</strong> Curve Finance pools have been exploited multiple times through read-only reentrancy, where attackers manipulated <em>get_virtual_price()</em> during callbacks to trick lending protocols.</p><h4><strong>Defense Strategies</strong></h4><p>Now that we understand how reentrancy attacks work, let’s explore the proven defense mechanisms. Each strategy addresses different aspects of the vulnerability, and in practice, you’ll often combine multiple approaches for robust protection.</p><p><strong>1. The CEI Pattern (Checks-Effects-Interactions)</strong></p><p>The CEI pattern is the <strong>single most important defense</strong> against reentrancy. It’s simple: always update your contract’s state before making external calls.</p><p><strong>The Three Steps:</strong></p><p>1. <strong>Checks</strong> — Validate conditions using require statements (happens first)</p><p>2. <strong>Effects</strong> — Update all state variables (happens second)</p><p>3. <strong>Interactions</strong> — Make external calls like transfers (happens last)</p><p><strong>❌ Wrong Order (Vulnerable):</strong></p><pre>function withdraw(uint amount) public {<br>    require(balances[msg.sender] &gt;= amount);    // Check<br>    msg.sender.call{value: amount}(&#39;&#39;);         // Interaction ← TOO EARLY!<br>    balances[msg.sender] -= amount;             // Effect ← TOO LATE!<br>}</pre><p><strong>✅ Correct Order (Safe):</strong></p><pre>function withdraw(uint amount) public {<br>    require(balances[msg.sender] &gt;= amount);    // Check<br>    balances[msg.sender] -= amount;             // Effect ← FIRST<br>    msg.sender.call{value: amount}(&#39;&#39;);         // Interaction ← LAST<br>}</pre><p><strong>Why it works:</strong> When the attacker’s callback tries to re-enter, the balance has already been set to zero. The <em>require</em> check fails, and the attack is blocked.</p><p><strong>2. Reentrancy Guards (The Mutex Lock)</strong></p><p>Sometimes CEI alone isn’t enough — especially in complex functions with multiple external calls. A reentrancy guard acts as a mutex lock that prevents any function from being called while it’s already executing.</p><p><strong>How It Works:</strong></p><pre>modifier nonReentrant() {<br>    require(_status != ENTERED, &quot;ReentrancyGuard: reentrant call&quot;);<br>    _status = ENTERED;<br>    _;<br>    _status = NOT_ENTERED;<br>}</pre><p><strong>The Execution Flow:</strong></p><ol><li>Function is called → Lock is acquired (<em>_status = ENTERED</em>)</li><li>Function executes → External calls happen</li><li>If attacker tries to re-enter → <em>require</em> fails, transaction reverts</li><li>Function completes → Lock is released (<em>_status = NOT_ENTERED</em>)</li></ol><p><strong>When to Use:</strong></p><ul><li>Functions with multiple external calls</li><li>Complex logic where CEI ordering is difficult</li><li>As an additional safety layer alongside CEI</li></ul><p><strong>⚠️ Limitation:</strong> Standard guards use contract-local storage. They won’t protect against cross-contract reentrancy unless both contracts share the same lock.</p><p><strong>3. Gas-Efficient Guards with EIP-1153</strong></p><p>Traditional reentrancy guards write to permanent storage (<em>SSTORE</em>), which costs ~20,000 gas per cold write. EIP-1153 introduced <strong>transient storage</strong> — data that exists only for the duration of a transaction.</p><p><strong>Cost Comparison:</strong></p><ul><li><strong>SSTORE (Traditional):</strong> ~20,000 gas per cold write, persists forever</li><li><strong>TSTORE (EIP-1153):</strong> ~100 gas, persists only for the transaction duration</li></ul><p><strong>Why Transient Storage Makes Sense:</strong></p><p>Reentrancy can only happen during a transaction. Once the transaction ends, there’s no more attack surface. So why pay for permanent storage when you only need protection for a few milliseconds?</p><p><strong>Implementation:</strong></p><pre>modifier nonReentrant() {<br>    assembly {<br>        if tload(SLOT) { revert(0, 0) }<br>        tstore(SLOT, 1)<br>    }<br>    _;<br>    assembly {<br>        tstore(SLOT, 0)<br>    }<br>}</pre><p>This achieves <strong>90%+ gas savings</strong> while providing identical protection.</p><p><strong>4. Pull-Over-Push Pattern</strong></p><p>Instead of <em>pushing</em> funds to users automatically, let users <em>pull</em> their funds when they’re ready. This architectural change eliminates the callback vector entirely.</p><p><strong>❌ Push Pattern (Risky):</strong></p><p>The contract initiates transfers, giving recipients control during execution.</p><pre>function distribute() public {<br>    for (uint i = 0; i &lt; users.length; i++) {<br>        users[i].transfer(amount);  // Each transfer is a potential attack vector<br>    }<br>}</pre><p><strong>✅ Pull Pattern (Safe):</strong></p><p>The contract records credits internally. Users claim funds separately.</p><pre>mapping(address =&gt; uint) public credits;<br><br>// Step 1: Record the credit (no external call)<br>function recordReward(address user, uint amount) internal {<br>    credits[user] += amount;<br>}<br><br>// Step 2: User claims their funds (isolated interaction)<br>function withdraw() public {<br>    uint amount = credits[msg.sender];<br>    credits[msg.sender] = 0;<br>    payable(msg.sender).transfer(amount);<br>}</pre><p><strong>Benefits:</strong></p><ul><li>No automatic callbacks during business logic</li><li>Each withdrawal is isolated and follows CEI</li><li>Failed withdrawals don’t affect other users</li></ul><p><strong>5. Protecting View Functions</strong></p><p>Read-only reentrancy exploits view functions that return stale data during a state gap. The solution: check if the contract is mid-execution before returning data.</p><p><strong>The Problem:</strong></p><p>Standard <em>nonReentrant</em> modifiers can’t be used on view functions because they modify state (the lock variable).</p><p><strong>The Solution:</strong></p><p>Use a read-only check that examines the lock status without modifying it:</p><pre>function getSharePrice() public view returns (uint) {<br>    // Check if we&#39;re mid-transaction (lock is held)<br>    if (_reentrancyGuardEntered()) {<br>        revert(&quot;Reentrant call&quot;);<br>    }<br>    return totalAssets / totalShares;<br>}</pre><p><strong>When to Apply:</strong></p><ul><li>Price oracle functions</li><li>Balance calculation functions</li><li>Any view function that external protocols depend on</li></ul><h4><strong>Conclusion</strong></h4><p>Reentrancy attacks have cost the DeFi ecosystem hundreds of millions of dollars — from The DAO’s $60M exploit in 2016 to Curve Finance’s read-only reentrancy incidents in recent years. Yet these attacks are entirely preventable.</p><p>The key insight is simple: <strong>security is not a feature you add later — it’s the structure of your logic from the start.</strong></p><p><strong>Your Defense Checklist:</strong></p><ol><li><strong>Always follow CEI</strong> — Update state before making external calls</li><li><strong>Use reentrancy guards</strong> — Add mutex locks to functions with external interactions</li><li><strong>Consider EIP-1153</strong> — Cut gas costs by 90% with transient storage</li><li><strong>Prefer pull over push</strong> — Let users withdraw instead of pushing funds to them</li><li><strong>Protect your view functions</strong> — Check lock status before returning price data</li><li><strong>Assume all external contracts are hostile</strong> — Design with adversarial thinking</li></ol><p>The recursion trap awaits those who ignore these patterns. But for developers who internalize them, reentrancy becomes a solved problem — not an existential threat.</p><img src="https://medium.com/_/stat?event=post.clientViewed&referrerSource=full_rss&postId=5fcd963e35a6" width="1" height="1" alt="">]]></content:encoded>
        </item>
        <item>
            <title><![CDATA[The Odyssey of Consensus: From Byzantine Generals to Blockchain]]></title>
            <link>https://arifintahu.medium.com/the-odyssey-of-consensus-from-byzantine-generals-to-blockchain-09f61bcc8074?source=rss-4dcc9c79c93------2</link>
            <guid isPermaLink="false">https://medium.com/p/09f61bcc8074</guid>
            <dc:creator><![CDATA[Miftahul Arifin]]></dc:creator>
            <pubDate>Sat, 27 Dec 2025 13:45:44 GMT</pubDate>
            <atom:updated>2025-12-27T13:45:44.610Z</atom:updated>
            <content:encoded><![CDATA[<p>How do computers agree on the truth when some of them might be lying? This deceptively simple question has driven four decades of innovation in distributed systems, culminating in the consensus protocols that now secure trillions of dollars in cryptocurrency and critical infrastructure worldwide.</p><h4><strong>The Problem: Agreement in the Face of Betrayal</strong></h4><p>Distributed systems — from cloud services to blockchains — rely on multiple independent computers (nodes) agreeing on a single source of truth. This is called <strong>consensus</strong>. But what happens when some nodes fail, or worse, act maliciously to disrupt the system?</p><p>Imagine you’re coordinating with colleagues across different offices to make a critical decision. You can only communicate via messages. Now imagine some of your colleagues might be actively trying to sabotage the decision by sending contradictory messages to different people. How do you ensure the honest participants can still reach agreement?</p><p>This is the essence of the Byzantine Generals’ Problem.</p><h4><strong>1982: The Byzantine Generals’ Problem</strong></h4><figure><img alt="" src="https://cdn-images-1.medium.com/max/1024/1*bkh8xfDi7PBUxFuc-IRFyQ.png" /></figure><p>In their landmark 1982 paper, Lamport, Shostak, and Pease formalized this challenge through a vivid metaphor: Byzantine army generals surrounding an enemy city must collectively decide to either attack or retreat. They can only communicate via messengers, and some generals may be traitors.</p><p>A traitorous general might send an “ATTACK” message to one loyal general and a “RETREAT” message to another, attempting to sow discord and cause failure. The question: can the loyal generals reach consensus despite the traitors?</p><p><strong>The Fundamental Impossibility</strong></p><p>The paper proved a startling result that still governs distributed systems today: <strong>with oral messages, no solution can handle m traitors with fewer than 3m + 1 total generals.</strong></p><p>Here’s why these matters:</p><ul><li>With one potential traitor, you need at least four generals</li><li>With only three generals, a single traitor can paralyze the loyal generals, making agreement impossible</li><li>To overcome m traitors, you need at least 2m + 1 honest nodes to form a majority, plus m potentially malicious nodes — totaling 3m + 1 nodes</li></ul><p>That extra honest node breaks the tie, creating the crucial honest majority. Without it, 2m honest nodes are paralyzed by doubt.</p><p>This wasn’t just theory — it established the mathematical bedrock for all Byzantine Fault Tolerant (BFT) systems to come.</p><h4><strong>1999: PBFT Makes BFT Practical</strong></h4><p>For nearly two decades, Byzantine fault tolerance remained largely theoretical. Then came Practical Byzantine Fault Tolerance (PBFT), a landmark breakthrough that transformed BFT from an academic curiosity into a viable engineering solution.</p><p>PBFT was the first to provide Byzantine state machine replication that worked efficiently in asynchronous environments like the internet, without relying on synchronous timing assumptions for correctness. The performance breakthrough was remarkable: PBFT ran only 3% slower than standard unreplicated systems.</p><p><strong>The Three-Phase Protocol</strong></p><figure><img alt="" src="https://cdn-images-1.medium.com/max/1024/1*aj_b0hRK5nflXuFXhXGE0A.jpeg" /></figure><p>PBFT coordinates nodes through three phases to agree on the total order of requests:</p><ol><li><strong>Pre-Prepare</strong>: The leader assigns a sequence number to a client request and broadcasts it</li><li><strong>Prepare</strong>: Replicas broadcast prepare messages, signaling agreement on the sequence number (nodes wait for 2f other prepare messages)</li><li><strong>Commit</strong>: Once nodes have seen enough prepare messages, they broadcast commit messages (after receiving 2f + 1 commits, the request executes)</li></ol><p>The challenge? If the leader fails, the system must perform a complex <strong>view change</strong> to elect a new one. This process, while effective, incurs quadratic communication complexity — a bottleneck that would later drive innovation.</p><h4><strong>2016: Tendermint Simplifies for Blockchain</strong></h4><figure><img alt="" src="https://cdn-images-1.medium.com/max/1024/1*OSiFuBdftdM5n-3H3shwhA.jpeg" /></figure><p>With the rise of blockchains, there was urgent demand for alternatives to energy-intensive Proof-of-Work. Tendermint was the first to popularize linking PBFT-style consensus to a Proof-of-Stake mechanism, where validators are chosen dynamically to produce blocks.</p><p>Tendermint’s key innovation was <strong>radical simplification</strong> of leader replacement. Instead of PBFT’s complex view-change sub-protocol, Tendermint uses a simple round-based state machine. If a leader fails, validators simply time out and move to the next round with a new, pre-determined proposer.</p><p>This simplicity and routine leader rotation made the protocol easier to implement and balanced communication loads. The trade-off? Tendermint lost <strong>responsiveness</strong> — latency depended on worst-case timeouts rather than actual network speed.</p><h4><strong>2018: HotStuff Achieves the Golden Standard</strong></h4><p>HotStuff emerged as a breakthrough that many consider the “golden standard for blockchains.” It achieved three critical properties simultaneously:</p><ol><li><strong>Optimistic Responsiveness</strong>: Latency depends on actual network speed, not worst-case timeouts</li><li><strong>Linear View-Change</strong>: Leader replacement has O(n) communication complexity instead of PBFT’s O(n²)</li><li><strong>Simplicity</strong>: An elegant protocol that’s easy to reason about</li></ol><p><strong>The Key Insight: Pipelining</strong></p><figure><img alt="" src="https://cdn-images-1.medium.com/max/1024/1*PEpuU5_1e2Jzh3dwQPTnsA.jpeg" /></figure><p>HotStuff’s genius lies in pipelining. Its phases are structured identically, allowing them to cascade: a new block proposal serves as a vote for the previous block, creating a chain of certifications.</p><p>The <strong>three-chain commit rule</strong> elegantly ensures safety: a block is committed once it’s at the head of a chain of three blocks, each proposed in consecutive views and certified with a Quorum Certificate (QC).</p><p>How does HotStuff achieve linear view changes? It uses an extra protocol phase to guarantee that if any node “locks” on a value, then a quorum of nodes (2f + 1) has received proof for that lock. This ensures the next leader will learn about the highest locked block by querying the network, even if f nodes are malicious.</p><h4><strong>2023: HotStuff-2 Reaches the Theoretical Optimum</strong></h4><p>While HotStuff was a major breakthrough, researchers noticed something: its three-phase commit was one phase more than the theoretical optimum of two. Could a protocol achieve all of HotStuff’s properties with only two phases?</p><p>HotStuff-2 proved the answer is yes. This 2023 optimization reduces the protocol to an optimal two-phase commit, <strong>improving latency by as much as 33%</strong> without sacrificing linearity or responsiveness.</p><p><strong>A Tale of Two Scenarios</strong></p><figure><img alt="" src="https://cdn-images-1.medium.com/max/1024/1*MiuDjL-K24Szoajg3Pdtag.jpeg" /></figure><p>HotStuff-2’s elegance comes from adaptive behavior based on network conditions:</p><ul><li><strong>Responsive Path</strong>: If the new leader receives a QC for a locked value from the preceding view, it knows it has the latest information and can immediately propose a new block — no waiting needed</li><li><strong>Synchronous Path</strong>: If the leader doesn’t obtain a QC, it knows the preceding view timed out. To ensure it doesn’t miss a locked value from a slow network partition, it safely waits for maximal network delay before proposing</li></ul><p>This conditional logic achieves optimality while maintaining safety guarantees.</p><h4><strong>Epilogue</strong></h4><p>Understanding consensus is understanding how trust can emerge from mathematics and clever protocol design, even when participants have every reason to doubt each other. It’s a testament to the power of distributed systems thinking — and a reminder that some of computing’s hardest problems require decades of iterative innovation to solve.</p><img src="https://medium.com/_/stat?event=post.clientViewed&referrerSource=full_rss&postId=09f61bcc8074" width="1" height="1" alt="">]]></content:encoded>
        </item>
        <item>
            <title><![CDATA[How Merkle Trees Secure Blockchain and Beyond]]></title>
            <link>https://arifintahu.medium.com/how-merkle-trees-secure-blockchain-and-beyond-d065a6e82df5?source=rss-4dcc9c79c93------2</link>
            <guid isPermaLink="false">https://medium.com/p/d065a6e82df5</guid>
            <dc:creator><![CDATA[Miftahul Arifin]]></dc:creator>
            <pubDate>Tue, 23 Dec 2025 01:53:29 GMT</pubDate>
            <atom:updated>2025-12-23T01:53:29.083Z</atom:updated>
            <content:encoded><![CDATA[<p>Ever wondered how Bitcoin can verify thousands of transactions in a single block without checking each one individually? Or how Git knows exactly which files changed in your repository? The answer is the Merkle tree — an elegant data structure that lets you verify massive amounts of data by checking just a tiny piece of it.</p><h4><strong>The Problem We’re Solving</strong></h4><p>Imagine you’re downloading a file with 1 million transactions from an untrusted source. You need to verify that:</p><ol><li><strong>Nothing was tampered with</strong> (data integrity)</li><li><strong>A specific transaction is included</strong> (membership proof)</li><li><strong>You can do this efficiently</strong> (without checking all 1 million items)</li></ol><p>Traditional approach? Hash all 1 million transactions together. But there’s a problem: if you want to verify just ONE transaction, you’d need to download ALL of them first!</p><p>This is where Merkle trees shine.</p><h4><strong>What Is a Merkle Tree?</strong></h4><p>A Merkle tree is a binary tree where:</p><ul><li><strong>Leaf nodes</strong> contain hashes of actual data (transactions, files, etc.)</li><li><strong>Parent nodes</strong> contain hashes of their children combined</li><li><strong>Root node</strong> (Merkle root) represents the hash of the entire dataset</li></ul><p>Think of it as a pyramid of trust that collapses all your data into a single fingerprint.</p><figure><img alt="" src="https://cdn-images-1.medium.com/max/1024/1*zkQdxq73QIYQlMqs9YKSbA.jpeg" /></figure><p>The tree builds from bottom to top:</p><ol><li>Hash each Leaf node individually</li><li>Combine adjacent hashes and hash them again</li><li>Repeat until you reach a single root hash</li></ol><h4><strong>How Merkle Proofs Work</strong></h4><p>Here’s the magic: to prove L1 is included, you don’t need all leaves. You only need:</p><ul><li>Hash(L1) — the leaf itself</li><li>H2 — the hash of L2</li><li>H34 — the hash of L3 and L4</li></ul><p>With these 3 hashes, anyone can verify L1 is in the tree by:</p><ol><li>Computing Hash(L1H2) = Hash(Hash(L1) + Hash(H2))</li><li>Computing Root = Hash(Hash(L1H2) + Hash(H34))</li><li>Comparing with the known root</li></ol><p><strong>Result</strong>: You verified 1 out of 4 transactions using only 3 hashes instead of 4. Now scale this to 1 million transactions: you’d need only ~20 hashes instead of 1 million!</p><h4><strong>Real-World Applications</strong></h4><p><strong>1. Bitcoin Block Verification</strong></p><p>Every Bitcoin block contains a Merkle root in its header. This enables:</p><ul><li><strong>Light clients</strong> (SPV wallets) to verify transactions without downloading the entire blockchain</li><li><strong>Proof of inclusion</strong> for any transaction with just a few hashes (~10–15 for typical blocks)</li></ul><p>Example: Your mobile Bitcoin wallet doesn’t store 500GB+ of blockchain data. It only stores block headers (~80MB) and uses Merkle proofs to verify your transactions.</p><p><strong>2. Ethereum State Verification</strong></p><p>Ethereum uses a more complex variant called a <strong>Merkle Patricia Tree</strong> to store:</p><ul><li>Account balances</li><li>Smart contract code</li><li>Contract storage</li></ul><p>This allows:</p><ul><li><strong>Stateless clients</strong> to verify specific account states</li><li><strong>Light clients</strong> to check balances without full node data</li><li><strong>Efficient state proofs</strong> for Layer 2 solutions</li></ul><p><strong>3. Git Version Control</strong></p><p>When you `git commit`, Git creates a Merkle tree of your files:</p><ul><li>Each file is hashed (blob)</li><li>Directory structures are hashed (tree)</li><li>The commit itself contains the root hash</li></ul><p>Benefits:</p><ul><li><strong>Instant change detection</strong>: different root = something changed</li><li><strong>Tamper-proof history</strong>: changing any file changes the entire commit hash</li><li><strong>Efficient diff operations</strong>: only changed branches need rehashing</li></ul><p><strong>4. IPFS (InterPlanetary File System)</strong></p><p>IPFS uses Merkle DAGs (Directed Acyclic Graphs) to:</p><ul><li>Address content by hash (content addressing)</li><li>Deduplicate identical files across the network</li><li>Verify file integrity on download</li><li>Enable efficient partial downloads</li></ul><p><strong>5. Certificate Transparency Logs</strong></p><p>Major browsers use Merkle trees to verify SSL certificates:</p><ul><li>All issued certificates are logged in public Merkle trees</li><li>Browsers can verify a certificate is properly logged</li><li>Detects misissued or fraudulent certificates</li><li>Append-only logs prevent tampering</li></ul><h4><strong>Why Merkle Trees Are So Powerful</strong></h4><p><strong>Efficiency</strong></p><p>For N data items, verification requires only <strong>O(log N)</strong>hashes:</p><ul><li>1,000 items → ~10 hashes</li><li>1,000,000 items → ~20 hashes</li><li>1,000,000,000 items → ~30 hashes</li></ul><p><strong>Security</strong></p><p>Changing any leaf cascades up:</p><ul><li>Altering L1 changes Hash(L1)</li><li>Which changes Hash(L1H2)</li><li>Which changes the Root</li><li>The tampered root won’t match the trusted root</li></ul><p><strong>Scalability</strong></p><p>Merkle proofs enable:</p><ul><li>Light clients (verify without full data)</li><li>Sharding (verify cross-shard transactions)</li><li>Layer 2 solutions (commit batches efficiently)</li></ul><h4><strong>Simple Implementation Example</strong></h4><p>Here’s how you might build a basic Merkle tree in pseudocode:</p><pre>function buildMerkleTree(transactions):<br>    // Start with leaf nodes<br>    nodes = [hash(tx) for tx in transactions]<br>    <br>    // Build tree bottom-up<br>    while len(nodes) &gt; 1:<br>        newLevel = []<br>        for i in range(0, len(nodes), 2):<br>            left = nodes[i]<br>            right = nodes[i+1] if i+1 &lt; len(nodes) else left<br>            parent = hash(left + right)<br>            newLevel.append(parent)<br>        nodes = newLevel<br>    <br>    return nodes[0]  // Merkle root<br><br>function verifyProof(leaf, proof, root):<br>    current = leaf<br>    for sibling in proof:<br>        current = hash(current + sibling)<br>    return current == root</pre><h4><strong>Conclusion</strong></h4><p>Merkle trees are the unsung heroes of modern distributed systems. They transform the problem of verifying large datasets from “download everything and check” to “download a tiny proof and verify instantly.”</p><p>Every time you:</p><ul><li>Send a Bitcoin transaction from your phone</li><li>Use a light Ethereum wallet</li><li>Push code to GitHub</li><li>Download from IPFS</li></ul><p>You’re leveraging the power of Merkle trees. They’re proof that elegant mathematics can solve real-world problems at scale.</p><p>However, Merkle trees are not a silver bullet. You must trust the Merkle root comes from a reliable source, and they don’t protect against withholding attacks where valid data is hidden. For efficient updates, additional structures like Merkle Patricia Trees are required. Tree balance also matters because unbalanced trees reduce efficiency. Most implementations use padding for incomplete levels to maintain balance.</p><img src="https://medium.com/_/stat?event=post.clientViewed&referrerSource=full_rss&postId=d065a6e82df5" width="1" height="1" alt="">]]></content:encoded>
        </item>
        <item>
            <title><![CDATA[The Unforgeable Seal: Understanding ECDSA Digital Signatures]]></title>
            <link>https://arifintahu.medium.com/the-unforgeable-seal-understanding-ecdsa-digital-signatures-177a1246de2e?source=rss-4dcc9c79c93------2</link>
            <guid isPermaLink="false">https://medium.com/p/177a1246de2e</guid>
            <category><![CDATA[cryptography]]></category>
            <category><![CDATA[ecdsa]]></category>
            <category><![CDATA[digital-signatures]]></category>
            <category><![CDATA[blockchain]]></category>
            <dc:creator><![CDATA[Miftahul Arifin]]></dc:creator>
            <pubDate>Sun, 21 Dec 2025 01:00:17 GMT</pubDate>
            <atom:updated>2025-12-21T01:00:17.060Z</atom:updated>
            <content:encoded><![CDATA[<p>Ever wondered how Bitcoin and Ethereum verify that YOU actually sent a transaction? The answer is ECDSA (Elliptic Curve Digital Signature Algorithm) — a clever mathematical system that proves you authorized a message without revealing your secret password.</p><h4><strong>The Problem We’re Solving</strong></h4><figure><img alt="" src="https://cdn-images-1.medium.com/max/1024/1*XSTDl-iuYl7q7eVultBc_A.jpeg" /></figure><p>Imagine Alice wants to send a message: “<strong>Send 10 ETH to Bob”</strong></p><p>She needs to prove two things:</p><p>1. <strong>She really sent it</strong> (anyone can verify)</p><p>2. <strong>Nobody can fake her signature</strong> (only she can create it)</p><p>But here’s the catch: she can’t reveal her private key (secret password) to prove it, or everyone could steal her money!</p><h4><strong>The Magic Behind It: One-Way Math</strong></h4><figure><img alt="" src="https://cdn-images-1.medium.com/max/1024/1*2bb8QF1vgOdo07oUiGUmvg.jpeg" /></figure><p>ECDSA works because of a mathematical “trapdoor” — something easy to do one way but nearly impossible to reverse.</p><p>Think of it like mixing paint:</p><p>- <strong>Easy</strong>: Mix blue + yellow → get green ✅</p><p>- <strong>Impossible</strong>: Look at green paint → figure out exact amounts of blue and yellow ❌</p><p>In ECDSA terms:</p><p>- <strong>Easy</strong>: Private key × Generator Point → Public key ✅</p><p>- <strong>Impossible</strong>: Public key → Find the private key ❌</p><p>This is called the <strong>Elliptic Curve Discrete Logarithm Problem </strong>— it’s so hard that even supercomputers can’t solve it in a reasonable time.</p><h4><strong>How ECDSA Works</strong></h4><p><strong>Creating a Signature (Signing)</strong></p><figure><img alt="" src="https://cdn-images-1.medium.com/max/1024/1*hOTBzUzvZ0-AuuE7tXmKJQ.jpeg" /></figure><p>When Alice signs a message, here’s what happens:</p><p>1. <strong>Hash the message</strong> — Turn “Send 10 ETH to Bob” into a fixed-size number</p><p>2. <strong>Pick a random number (k) </strong>— This is super important and must NEVER be reused!</p><p>3. <strong>Do some math </strong>— Create two numbers called `r` and `s`</p><p>4. <strong>Send the signature</strong> — The pair `(r, s)` is the signature</p><p>The magic is in step 3: the formula `s = k⁻¹(hash + r × private_key)` ties together the message, the private key, and the random number in a way that can be verified but not forged.</p><p><strong>Checking a Signature (Verification)</strong></p><figure><img alt="" src="https://cdn-images-1.medium.com/max/1024/1*qbr9fXx5swyuqPcGJtI_hw.jpeg" /></figure><p>When someone wants to verify Alice’s signature:</p><p>1. <strong>Hash the message</strong> — Get the same number Alice got</p><p>2. <strong>Do some calculations</strong> — Use the public key and signature</p><p>3. <strong>Check if it matches</strong> — If the math works out, the signature is valid!</p><p>The verifier never sees Alice’s private key, but the math proves she must have known it to create the signature.</p><h4><strong>Why This Is Secure</strong></h4><p>ECDSA is secure because of three key principles:</p><p><strong>The One-Way Function</strong>: You can’t work backwards from the public key to find the private key. It’s mathematically protected.</p><p><strong>The Random Challenge</strong>: The signature includes information that couldn’t be pre-computed. An attacker can’t prepare a fake signature in advance.</p><p><strong>Circular Dependency</strong>: The signature formula creates a chicken-and-egg problem for attackers — they’d need to know the answer before they can start calculating, which is impossible.</p><h4><strong>The Critical Warning: Never Reuse the Random Number</strong></h4><figure><img alt="" src="https://cdn-images-1.medium.com/max/1024/1*h5Ufe4ro6ZoHygTNBH8M_w.jpeg" /></figure><p>Here’s where things get dangerous. Remember that random number `k` from the signing process? If you ever use the same `k` for two different messages, your private key can be calculated!</p><p><strong>Real disasters from reusing k:</strong></p><ul><li><strong>Sony PS3 Hack (2010)</strong>: Sony’s developers used the same `k` for all PlayStation 3 firmware signatures. Hackers figured this out, extracted Sony’s private key, and could sign their own code. The PS3 security was completely broken.</li><li><strong>Bitcoin Thefts</strong>: Multiple Bitcoin wallets had weak random number generators that sometimes produced the same `k` value. Attackers detected these repeated values and stole users’ Bitcoin by recovering their private keys.</li></ul><p>The lesson: `k` must be truly random, kept secret, and never ever reused.</p><h4><strong>Why ECDSA Matters</strong></h4><p>ECDSA is everywhere in blockchain and crypto:</p><p><strong>Bitcoin &amp; Ethereum</strong>: Every transaction you send is signed with ECDSA</p><p><strong>Cryptocurrency Wallets</strong>: Your wallet uses ECDSA to prove you own your coins</p><p><strong>Smart Contracts</strong>: Signatures authorize contract interactions</p><p><strong>Web Security</strong>: Many HTTPS certificates use ECDSA</p><p>The beauty of ECDSA is its efficiency. A 256-bit ECDSA key provides the same security as a 3072-bit RSA key — that’s 12 times more efficient!</p><h4><strong>What Makes a Good Digital Signature?</strong></h4><p>Think of ECDSA like a high-tech wax seal on an envelope:</p><p>- <strong>Anyone can verify</strong> ✅ it’s your seal (using your public key)</p><p>- <strong>Only you can create</strong> ✅ it (requires your private key)</p><p>- <strong>Can’t be copied</strong> ✅ to another message (tied to the content)</p><p>- <strong>Can’t be forged</strong> ✅ (protected by hard math problems)</p><h4><strong>The Future: Post-Quantum Signatures</strong></h4><p>ECDSA has one weakness: quantum computers. While today’s computers can’t break ECDSA, future quantum computers theoretically could.</p><p>Researchers are already preparing alternatives:</p><p>- <strong>CRYSTALS-Dilithium</strong> (lattice-based)</p><p>- <strong>SPHINCS+</strong> (hash-based)</p><p>- <strong>Rainbow</strong> (multivariate)</p><p>These “<strong>post-quantum</strong>” signature schemes will protect us when quantum computers become powerful enough to threaten ECDSA.</p><img src="https://medium.com/_/stat?event=post.clientViewed&referrerSource=full_rss&postId=177a1246de2e" width="1" height="1" alt="">]]></content:encoded>
        </item>
        <item>
            <title><![CDATA[How to Acquire a New Language Effectively]]></title>
            <link>https://arifintahu.medium.com/how-to-acquire-a-new-language-effectively-985bae56ce49?source=rss-4dcc9c79c93------2</link>
            <guid isPermaLink="false">https://medium.com/p/985bae56ce49</guid>
            <category><![CDATA[learning]]></category>
            <dc:creator><![CDATA[Miftahul Arifin]]></dc:creator>
            <pubDate>Mon, 23 Nov 2020 00:22:00 GMT</pubDate>
            <atom:updated>2020-11-23T00:25:20.346Z</atom:updated>
            <content:encoded><![CDATA[<figure><img alt="" src="https://cdn-images-1.medium.com/max/640/0*LJB6zGMQhIsc9mlo.jpg" /></figure><p>Recently, I watched a fascinating video about the secrets of learning a new language by Lydia Machova. Well I got a new insight about how polyglot could acquire new languages quickly. For instance Lydia said that she could master a new language in two years. Brilliant! I was wondering how could it be?</p><p>Firstly learning a new language is about process just like the other learning. Basically without enjoying the process then learning is no longer fun. For instance when we were in childhood, we kept learning many things such how to eat, walk, run, and so on. Moreover, we frequently made mistakes when we were learning some basics. Similarly, learning a new language is about enjoying the process. I would say that we should draw in our mind that learning a new language is much fun by creating whatever amazing imaginations. For instance we could create imaginations such as travelling around the world and speaking to native with the language which we have learned.</p><p>Secondly finding out an effective methods. I believe that everyone has a unique style of learning. Instead of figuring out the effective one by ourselves, we could take into account the method of someone who has mastered in languages. Probably it would be working. However, it is all about the process, we could pick some methods and try to implement then evaluate the result. Well some methods which is worked to me are daily self-speaking, writing daily notes, and daily learning through Duolingo.</p><p>Thirdly about system. Creating a learning system in our daily life is a great deal to maintain for the long term. However, it would be difficult in the beginning but it would be worth if we could build a sustainable system. Moreover, it means that we build learning habits into our daily activities such as what time do you plan for learning in each day, what is your goal, and what method do you use. Not to mention, the evaluation of our system is also important. Furthermore, we could set up evaluation in each week or month to see how much far the progress.</p><p>Finally patience. It is the key of learning anything especially learning a language. As I mention earlier, learning is about process. However, we couldn’t acquire a new language is one night but it is like a building block. We need to maintain our process to create a new block and hopefully in the future it would be plenty of things that we have learned. Being patience could keep us enjoying the learning process little by little.</p><p>Keep learning!</p><p><em>Originally published at </em><a href="https://www.arifintahu.com/2020/11/how-to-acquire-new-language-effectively.html"><em>https://www.arifintahu.com</em></a><em> on November 23, 2020.</em></p><img src="https://medium.com/_/stat?event=post.clientViewed&referrerSource=full_rss&postId=985bae56ce49" width="1" height="1" alt="">]]></content:encoded>
        </item>
        <item>
            <title><![CDATA[My Reading Notes : How To Be A Productivity Ninja]]></title>
            <link>https://arifintahu.medium.com/my-reading-notes-how-to-be-a-productivity-ninja-61c0a60e606f?source=rss-4dcc9c79c93------2</link>
            <guid isPermaLink="false">https://medium.com/p/61c0a60e606f</guid>
            <category><![CDATA[books]]></category>
            <category><![CDATA[book-review]]></category>
            <category><![CDATA[productivity]]></category>
            <dc:creator><![CDATA[Miftahul Arifin]]></dc:creator>
            <pubDate>Sun, 11 Oct 2020 02:31:00 GMT</pubDate>
            <atom:updated>2020-11-10T00:45:09.449Z</atom:updated>
            <content:encoded><![CDATA[<h3>My Reading Notes : How To Be A Productivity Ninja</h3><figure><img alt="" src="https://cdn-images-1.medium.com/max/640/0*lx8_Sdd_x_x0ymWH.jpg" /></figure><p>I have read some kind of books about productivity. Many books often explain productivity as time management, goal achievement, building habits, and so on. But, this time I got new insights from Graham Allcott’s book which offers a radical tips of productivity. Let’s dive in what is inside.</p><p>Graham said time management is dead. It’s often taught that good time management is the key to productivity, success, and happiness. There are thousands of books on time management said that we have to prioritize the right things, start the day with a list and do from most important. It sound so easy and perfect, doesn’t it?</p><p>But as time goes flies, the game changed. We now live in age where connection and information overload. We are bombarded with a lot of information from many different sources such as our smartphone, tv, and so on. In the old time management books, dealing with a new input is simple enough. However this time, it can be distracting to us. Eventually, we will never get things done because of real works buried with unrelated emails, messages, social media, notifications, and more over.</p><p>The way of productivity ninja offers how we ‘think’ about our work, not how we ‘do’ about our work. It has a huge different. When we think about our work, so it’s about decision making. The art of decision making is our ability to make space for the ‘quality thinking time’ and how we react. Instead of time management, Graham defines attention management as foundation of decision making on how we react on our work.</p><p>Attention management comes in to reduce the battle against stress and overloaded information. Our attention is more limited that our time. Sometimes, we got to the end of the day when we have still got a lot things to do. Meanwhile, we often tell to ourselves that we ran out of time, but the reality we ran of attention to give.</p><p>Attention is finite. In an average day, we have different levels of attention such as proactive attention, active attention, and inactive attention. Proactive attention is where we are fully focused, alert, and ready to make the most important decision or to tack most complex task. Then active attention is where we are plugged in but perhaps flagging slightly. In this state, we are easily distracted, brilliant, but often sloppy. The last inactive attention is where the lights are on but no one appears to be home. There are not much brain power left and we are likely to struggle with difficult tasks.</p><p>So what we have to do? Proactive attention is less than what we expect. It’s just about 2–3 hours a day, Monday to Thursday at 9–11am, and just one and a half to two hours in Friday. As we know, our proactive attention is a scarce and valuable commodity in our quest to be productivity and to reduce stress and overloaded information.</p><p>There are four things required to do in order to optimize our work with our limited proactive attention.</p><blockquote><strong>1. Schedule our work according to the attention level that we are operating on</strong></blockquote><blockquote><strong>2. Protect our attention as much as we can from the distractions and interruptions</strong></blockquote><blockquote><strong>3. Do whatever we can to increase attention flow, moving up to make periods of inactive attention become active ones</strong></blockquote><blockquote><strong>4. Magic up by creating additional pockets of attention such as preparing reading materials while waiting or maybe thinking while travelling</strong></blockquote><p>Attention management is just of one productivity ninja from this book. But I would like to say that is the important part because when we can manage our attention. Everything will be done without worrying about stress and overloaded information.</p><p>Just want to add a quote from Nietzshe</p><blockquote>“The worst enemy you can meet will always yourself”.</blockquote><p>Then controlling our attention is about controlling ourselves.</p><p>By <em>Miftahul </em>Arifin</p><p><em>Originally published at </em><a href="https://www.arifintahu.com/2020/10/my-reading-notes-how-to-be-productivity.html"><em>https://www.arifintahu.com</em></a><em> on October 11, 2020.</em></p><img src="https://medium.com/_/stat?event=post.clientViewed&referrerSource=full_rss&postId=61c0a60e606f" width="1" height="1" alt="">]]></content:encoded>
        </item>
        <item>
            <title><![CDATA[My Reading Notes : How To Enjoy Your Life and Your Job]]></title>
            <link>https://arifintahu.medium.com/my-reading-notes-how-to-enjoy-your-life-and-your-job-b4dd810ccdae?source=rss-4dcc9c79c93------2</link>
            <guid isPermaLink="false">https://medium.com/p/b4dd810ccdae</guid>
            <category><![CDATA[books]]></category>
            <category><![CDATA[book-review]]></category>
            <category><![CDATA[jobs]]></category>
            <category><![CDATA[life]]></category>
            <dc:creator><![CDATA[Miftahul Arifin]]></dc:creator>
            <pubDate>Sun, 20 Sep 2020 01:37:00 GMT</pubDate>
            <atom:updated>2020-11-10T00:41:37.948Z</atom:updated>
            <content:encoded><![CDATA[<h3>My Reading Notes : How To Enjoy Your Life and Your Job</h3><figure><img alt="" src="https://cdn-images-1.medium.com/max/640/0*sWboUC_d34kdcIw-.jpg" /></figure><p>I found one of interesting books by Dale Carnegie in the BBW event. At that time, I was wondering Dale Carnegie’s book with the title “How to Enjoy Your Life and Your Job”. Then, I bought one and figured out that this book was summary collections from Dale Carnegie’s two best sellers, “How to Win Friends and Influence People” and “How to Stop Worrying and Start Living”.</p><p>I would say this book is great to improve our attitude toward our job. This means that our attitude can determine whether our days are filled with excitement and the sense of fulfillment — or frustration, boredom, and fatigue. This is why some people feel exhausted but they did nothing.</p><p>Therefore, this book tells about how to deal with our job including habit, doing task, and handling people. However, I’d like to note on how to banish boredom and start living peacefully with happiness toward our job.</p><p><strong>1. Find yourself and be yourself</strong></p><p>We are unique in this world with such abilities, so let’s not waste worrying because we are not like the others. Be glad of it. We can paint only what we are. We must be what our experiences, our environment, and out heredity have made us. Then, we must cultivate our own little garden. Just be yourself.</p><p><strong>2. Build good working habits</strong></p><p>Small things mean everything. Most of our attitude are responses from our habits. Dale Carnegie gives four habits that will help prevent fatigue and worry, they are — clear our desk of all papers except those relating to problem, — do things in the order of their importance, — when you face a problem then solve it, — and learn to organize, deputize and worry.</p><p><strong>3. Figure out what makes you tired</strong></p><p>Joseph E. Barmack published a report of his experiments, showing how boredom produces fatigue. From his experiments showed that the blood pressure of the body and the consumption of oxygen actually decrease when people are bored, and the whole metabolism picks up immediately as soon as they begin to feel interest and pleasure in their work. Because of that our fatigue is often caused not by work, but by worry, frustration, and resentment. So, figure out what makes you bored.</p><p><strong>4. Count your blessing not troubles</strong></p><p>No matter how much troubles that we have, don’t worry we have much more blessing than troubles. Stop worrying and start living. Just do the very best you can.</p><p>To me that’s the important notes. Following Dale Carnegie is an adventure in self-discovery and it could be a turning point in our life. All we need now is the determination to uncover our self.</p><p><em>By Miftahul Arifin</em></p><p><em>Originally published at </em><a href="https://www.arifintahu.com/2020/09/my-reading-notes-how-to-enjoy-your-life.html"><em>https://www.arifintahu.com</em></a><em> on September 20, 2020.</em></p><img src="https://medium.com/_/stat?event=post.clientViewed&referrerSource=full_rss&postId=b4dd810ccdae" width="1" height="1" alt="">]]></content:encoded>
        </item>
        <item>
            <title><![CDATA[My Reading Notes : Storytelling with Data]]></title>
            <link>https://arifintahu.medium.com/my-reading-notes-storytelling-with-data-923d7c7739e7?source=rss-4dcc9c79c93------2</link>
            <guid isPermaLink="false">https://medium.com/p/923d7c7739e7</guid>
            <category><![CDATA[data]]></category>
            <category><![CDATA[book-review]]></category>
            <category><![CDATA[books]]></category>
            <dc:creator><![CDATA[Miftahul Arifin]]></dc:creator>
            <pubDate>Sun, 09 Aug 2020 02:53:00 GMT</pubDate>
            <atom:updated>2020-11-10T00:48:41.744Z</atom:updated>
            <content:encoded><![CDATA[<h3>My Reading Notes : Storytelling with Data</h3><figure><img alt="" src="https://cdn-images-1.medium.com/max/640/0*bBh7Rydf6TQc9X_f.jpeg" /></figure><p>When I was learning about big data world, I found an interesting article. It told about data visualization techniques like never before. Afterwards, I got book’s recommendation about techniques behind data storytelling written by Cole Nussbaumer. Soon, I searched the book on the online store and I got one.</p><p>Storytelling with Data by Cole Naussbaumer Knaflic. The book is very organized and it has a beautiful insight. The writer specializes in the effective display of quantitative information and writes the popular blog storytellingwithdata.com. She has experiences on the Google People Analytics and so on.</p><blockquote><strong>What I got from this book is how to deal with visualizing data. It’s not just we serve visualization at all. However, we design a good visualization and show the insight from it. Sounds easy right? But I think no, bad graphs are everywhere.</strong></blockquote><p>Most people don’t know how to serve a good summary of data. In school, we learn a lot about language and math. On the language side, we learn how to put words together into sentences and stories. With math, we learn to make sense of numbers. But it’s rare that these two sides combined together. Very few people feel naturally adept in this space.</p><p>From the writer’s experiences, she travels around the world of ineffective graph ad develops in her own concept how to deal with an effective display of quantitative information. Fortunately, we can learn about practical guidance that we can begin using immediately to better communicate visually with data. Here’s six key lessons that we can try it out:</p><blockquote><strong>In order to understand the context, we have to know who our audience is and what they need. Then after we got information from our audience, we have to consider how to present it.</strong></blockquote><p>There are dozens of visual displays. But not all of them effective to present our data such as table, heatmaps, line graph, bar chart, pie chart, and so on. One tips from the writer is don’t apply pie chart or any three dimension graphs because of its difficult to read.</p><p>It’s important to identify and eliminate clutter in order to display a clean design. One of the best methods that we can apply is Gestalt Principles of Visual Perception. It gives us about how our brain works on the visual information.</p><p>On this step, we explore how pre-attentive attributes can be used strategically to help direct our audience’s attention. For example we can modify size, colour, and position to visually attract audiences.</p><blockquote><strong>Thinking like a designer by considering affordances as cues for how to interact with our communication such as highlight the important stuff, eliminate distractions, and create a visual hierarchy of information.</strong></blockquote><p>Final step is crafting a story with clear beginning (plot), middle (twists), and end (call to action). We can consider the order and manner of our narrative to be more interesting.</p><p>That’s all the outline that I got, see on my next reading notes.</p><p><em>By Miftahul Arifin</em></p><p><em>Originally published at </em><a href="https://www.arifintahu.com/2020/08/my-reading-notes-storytelling-with-data.html"><em>https://www.arifintahu.com</em></a><em> on August 9, 2020.</em></p><img src="https://medium.com/_/stat?event=post.clientViewed&referrerSource=full_rss&postId=923d7c7739e7" width="1" height="1" alt="">]]></content:encoded>
        </item>
        <item>
            <title><![CDATA[What I Got After Learning Blender 3D Modelling for One Month]]></title>
            <link>https://arifintahu.medium.com/what-i-got-after-learning-blender-3d-modelling-for-one-month-87a8d0716310?source=rss-4dcc9c79c93------2</link>
            <guid isPermaLink="false">https://medium.com/p/87a8d0716310</guid>
            <category><![CDATA[3d-modeling]]></category>
            <category><![CDATA[challenge]]></category>
            <category><![CDATA[blender3d]]></category>
            <dc:creator><![CDATA[Miftahul Arifin]]></dc:creator>
            <pubDate>Thu, 02 Jul 2020 01:38:00 GMT</pubDate>
            <atom:updated>2020-11-10T00:52:11.483Z</atom:updated>
            <content:encoded><![CDATA[<figure><img alt="" src="https://cdn-images-1.medium.com/max/640/0*1NFE_9tEMarlOOOW.png" /></figure><p>Last month, I challenged myself to learn 3D modelling using Blender, an open source 3D software. Then I want to share what I got after learning Blender for one month every day. 3D modelling stuffs are quite new for me. However, I tried to learn by myself using whatever resources where I found. The picture on above is my first final render of my first 3D model. I would say making donut is like “Hello World” in the programming world.</p><p>Before starting my challenge, I set up daily target learning blender for one hour in each day. Then I noted the specific time which I used one hour before I started working from 7 AM to 8 AM. So roughly in one month I have spent about 30 hours for learning 3 modelling. I think spending one hour in a day isn’t quite difficult, but I want to start by small and just to see my next progress.</p><p>Then, all of my learning materials are from YouTube tutorial such as Blender Guru, Polygon Runaway, and Grant Abbitt. I prefer those tutorials due to explaining the process with much better commentary.</p><p>For the first model, I followed Blender Guru’s donut tutorials step by step. I think that’s kind of best tutorial for blender beginner like me. Here’s my render progress from following donut tutorials with modified. I spent about one week with one hour each day. My background isn’t art or design, so I just follow whatever on my intuition.</p><figure><img alt="" src="https://cdn-images-1.medium.com/max/640/0*FXrJiFhhMznG7xtV.png" /></figure><p>In donut’s model I learnt much about the tools and techniques of blender. There were a bunch of methods that I could use. After finishing the donut model, I got much techniques such as modelling, sculpting, shading, colouring, lighting, and so on. However, I think that’s just a surface of modelling techniques.</p><p>The next model I tried to build low poly design which I followed from YouTube. I am interested in low poly design because it’s much simpler and low memory consumption. When I was making donut model, I got stuck on my program due to the memory consumption reached two giga bytes, and that’s so much big to handle by my laptop. So instead, in case of learning I prefer to learn low poly model. Here’s my final render.</p><figure><img alt="" src="https://cdn-images-1.medium.com/max/400/0*aOHBpC3SQrnZrEKQ.png" /></figure><p>Then, the final model on my challenge was building a hut from another tutorials too. I think this is the most difficult due to much of components that I made. It’s just simpler model than the tutorial model. Here’s what I made.</p><figure><img alt="" src="https://cdn-images-1.medium.com/max/640/0*7tSE7qyA3h8ivuO7.png" /></figure><blockquote>For conclusion, I got much of stuffs after finishing my challenge. I believe everyone can do what they want. But not everyone may persist their consistency. To achieve our goal, we have to maintain our progress even small progress.</blockquote><blockquote>Big success always starts by small steps, and I believe that. And not only doing our task or job, but we have to maintain it everyday from our commitment. Just always do our best.</blockquote><p>I think I’d like to continue learning 3D modelling just for fun. See you for next challenge. And what about you?</p><p><em>Originally published at </em><a href="https://www.arifintahu.com/2020/07/what-i-got-after-learning-blender-3d.html"><em>https://www.arifintahu.com</em></a><em> on July 2, 2020.</em></p><img src="https://medium.com/_/stat?event=post.clientViewed&referrerSource=full_rss&postId=87a8d0716310" width="1" height="1" alt="">]]></content:encoded>
        </item>
        <item>
            <title><![CDATA[Search For Meaning of Life]]></title>
            <link>https://arifintahu.medium.com/search-for-meaning-of-life-85b5218ad5e9?source=rss-4dcc9c79c93------2</link>
            <guid isPermaLink="false">https://medium.com/p/85b5218ad5e9</guid>
            <category><![CDATA[life]]></category>
            <dc:creator><![CDATA[Miftahul Arifin]]></dc:creator>
            <pubDate>Wed, 27 Nov 2019 14:57:08 GMT</pubDate>
            <atom:updated>2019-11-27T14:57:08.534Z</atom:updated>
            <content:encoded><![CDATA[<p>I have read a book that made me inspired. The title was Man’s Search for Meaning by Viktor E Frankl. This book was talking about Frank’s experiences as prisoner during Holocaust in World War II. It was tough life, but Frank found the meaning of life in there.</p><p>Imagine how could you live in the camp where you had to work all day without paying except small amount of soup and bread. And not just about that, you had to sleep in the small hut that exceeds capacity with straw as a bed. Day by day you had to live with this condition without knowing when you would be free. That was Frank’s small part of experiences in the camp.</p><p>So, how could Frank survive in the camp as we knew the history said there were 1.5 millions people died. In his book, Frank explained that people who had meaning for his life tends to survive longer than who hadn’t.</p><p>Life is not about pleasure, but life is about searching for the meaning. We can not find the happiness, but we can find the reason of happiness. Rich man perhaps have all of they want, but may be not happy. And poor man perhaps do not have all of they want, but may be enjoying their life.</p><p>If we pursue for happiness and success, we are just making ourselves further. The happiness and success are just an impact of our effort striving for the highest goal.</p><p>The main thing of our life is searching the meaning of life. Every people maybe have different meaning, but the meaning must be for the others like loving the family, giving impact to the society, and more.</p><img src="https://medium.com/_/stat?event=post.clientViewed&referrerSource=full_rss&postId=85b5218ad5e9" width="1" height="1" alt="">]]></content:encoded>
        </item>
    </channel>
</rss>