{"id":60869,"date":"2026-06-21T22:53:40","date_gmt":"2026-06-21T14:53:40","guid":{"rendered":"https:\/\/nightfame.com\/style\/?p=60869"},"modified":"2026-06-21T23:05:38","modified_gmt":"2026-06-21T15:05:38","slug":"chapter-7-the-commit-reveal-scheme-the-front-running-fencer","status":"publish","type":"post","link":"https:\/\/nightfame.com\/style\/chapter-7-the-commit-reveal-scheme-the-front-running-fencer\/","title":{"rendered":"Chapter 7: The Commit-Reveal Scheme – The Front-Running Fencer"},"content":{"rendered":"
\n
\"\"<\/figure><\/div>\n\n\n

<\/p>\n\n\n\n

The testnet ran for eleven days without a single front-running attack.<\/p>\n\n\n\n

Jesse checked it every morning before school, every evening after work, and often in between when he should have been paying attention in class. The dashboard became a habit\u2014green transactions scrolling past, the VRF ordering protocol humming along, no sign of The Seeker or any other bot.<\/p>\n\n\n\n

But Nia wasn’t celebrating.<\/p>\n\n\n\n

\u201cIt\u2019s too quiet,\u201d she said on the twelfth day, hunched over her monitor in the dim glow of the validator nodes. \u201cThe Seeker knows about the testnet. It should be trying to break it. Why isn\u2019t it trying?\u201d<\/p>\n\n\n\n

Jesse sat on the floor, back against the wall, a notebook open in his lap. He\u2019d started keeping a journal of everything he learned\u2014VRF, mempool dynamics, validator incentives. The notebook was already half full.<\/p>\n\n\n\n

\u201cMaybe it can\u2019t break it,\u201d he said. \u201cMaybe the VRF ordering actually works.\u201d<\/p>\n\n\n\n

\u201cMaybe.\u201d Nia didn\u2019t sound convinced. \u201cOr maybe it\u2019s waiting. Watching. Learning. The Seeker doesn\u2019t attack until it understands the terrain.\u201d<\/p>\n\n\n\n

\u201cYou make it sound like a military strategist.\u201d<\/p>\n\n\n\n

\u201cIt\u2019s programmed by military strategists. The people who run these bots aren\u2019t amateurs. They\u2019re former quantitative traders, hedge fund quants, people who\u2019ve spent decades finding edges in financial markets.\u201d She turned to face him. \u201cBlockchain is just a new battlefield. The tactics are the same.\u201d<\/p>\n\n\n\n

Jesse closed his notebook. \u201cThen we need to understand the next vulnerability. What\u2019s the weakest part of our protocol right now?\u201d<\/p>\n\n\n\n

Nia stood up and walked to the whiteboard. It was covered in diagrams from the past two weeks\u2014VRF flowcharts, validator coordination schemes, network latency models. She erased a corner and drew three boxes in a row.<\/p>\n\n\n\n

\u201cOur protocol has three layers,\u201d she said. \u201cLayer one is VRF ordering. That\u2019s working. Layer two is commit-reveal. We haven\u2019t built it yet. Layer three is encrypted mempool. That\u2019s still in research.\u201d<\/p>\n\n\n\n

\u201cSo the vulnerability is that we don\u2019t have layers two and three.\u201d<\/p>\n\n\n\n

\u201cExactly. Right now, on the testnet, transactions are still visible in the mempool. The VRF ordering makes the order unpredictable, but The Seeker can still see<\/em> what you\u2019re trying to buy. And if it can see, it can try to front-run\u2014even if it can\u2019t guarantee success, it can still inject its own transaction and hope the random ordering puts it ahead of you.\u201d<\/p>\n\n\n\n

Jesse thought about that. \u201cSo commit-reveal is about hiding the transaction until after ordering is locked.\u201d<\/p>\n\n\n\n

Nia nodded. She drew a new diagram\u2014two columns, labeled COMMIT<\/em> and REVEAL<\/em>.<\/p>\n\n\n\n

\n\n\n\n

Scene 1: Understanding the Vulnerability<\/strong><\/p>\n\n\n\n

\u201cLet me show you why visibility is the real problem,\u201d Nia said, pulling up a simulation on her laptop. \u201cThis is a model of the testnet with VRF ordering but no commit-reveal. Watch what happens when a user tries to buy a rare artifact.\u201d<\/p>\n\n\n\n

The simulation ran. Jesse saw a user\u2019s transaction appear in the mempool\u2014a purchase request for a limited-edition sword. The VRF assigned it a random position in the next block. But before the block was built, The Seeker\u2019s bot saw the transaction and submitted its own purchase for the same sword, also with a random VRF position.<\/p>\n\n\n\n

\u201cNow both transactions are in the mempool,\u201d Nia said. \u201cThe Seeker doesn\u2019t know which one will land first\u2014that\u2019s the VRF working. But it doesn\u2019t need to know. It just needs to submit many<\/em> transactions, all for the same sword, all with different random positions. Statistically, one of them will end up ahead of the user.\u201d<\/p>\n\n\n\n

She ran the simulation a hundred times. The results were grim. In seventy-three out of a hundred runs, at least one of The Seeker\u2019s transactions landed ahead of the user. In forty-two runs, The Seeker got the sword. The user got nothing.<\/p>\n\n\n\n

\u201cSo VRF ordering slows down the bots,\u201d Jesse said, \u201cbut it doesn\u2019t stop them. They just spam the mempool with copies.\u201d<\/p>\n\n\n\n

\u201cExactly. The Seeker doesn\u2019t need to see the future. It just needs to flood the zone. And it can do that because it can see every transaction in the mempool.\u201d Nia closed the simulation. \u201cWe need to take away its vision. We need to make the mempool blind.\u201d<\/p>\n\n\n\n

\u201cThat\u2019s where commit-reveal comes in.\u201d<\/p>\n\n\n\n

\u201cThat\u2019s where commit-reveal comes in.\u201d<\/p>\n\n\n\n

\n\n\n\n

Scene 2: The Commit-Reveal Scheme<\/strong><\/p>\n\n\n\n

Nia uncapped a fresh marker and drew on the whiteboard with renewed energy.<\/p>\n\n\n\n

\u201cCommit-reveal is a two-step protocol. Step one: the user submits a hash<\/em> of their transaction, not the transaction itself. A hash is like a fingerprint\u2014unique to that transaction, but impossible to reverse. You can\u2019t look at a hash and figure out what the original transaction was.\u201d<\/p>\n\n\n\n

She wrote: Hash = fingerprint(Tx)<\/strong><\/p>\n\n\n\n

\u201cThe hash goes into the mempool. Validators order the hashes using VRF, just like before. But at this point, no one\u2014not the validators, not The Seeker, not anyone\u2014knows what the actual transactions are. They only see fingerprints.\u201d<\/p>\n\n\n\n

Jesse nodded. \u201cSo The Seeker sees a hash and has no idea if it\u2019s a sword purchase, a coffee payment, or someone moving money between their own accounts.\u201d<\/p>\n\n\n\n

\u201cExactly. It can\u2019t front-run what it can\u2019t understand.\u201d<\/p>\n\n\n\n

Nia drew the second step. \u201cStep two: reveal<\/em>. After the ordering is locked\u2014after the block of hashes is finalized\u2014users submit the actual transaction data. The validators then execute the transactions in the already-determined order. The Seeker sees the real transaction at the same time everyone else does. By then, it\u2019s too late to front-run.\u201d<\/p>\n\n\n\n

She stepped back from the whiteboard. The diagram showed a clear flow: Submit Hash \u2192 Order Hashes \u2192 Lock Order \u2192 Reveal Transaction \u2192 Execute.<\/strong><\/p>\n\n\n\n

\u201cThat\u2019s beautiful,\u201d Jesse said.<\/p>\n\n\n\n

\u201cIt\u2019s standard cryptography. People have been using commit-reveal for decades\u2014voting systems, sealed-bid auctions, anything where you want to hide intent until after a commitment is made.\u201d Nia capped the marker. \u201cBut there\u2019s a catch.\u201d<\/p>\n\n\n\n

\u201cThere\u2019s always a catch.\u201d<\/p>\n\n\n\n

\n\n\n\n

Scene 3: The Blind Spot<\/strong><\/p>\n\n\n\n

Nia sat back down at her desk and pulled up a document she\u2019d been working on\u2014a draft of the commit-reveal specification.<\/p>\n\n\n\n

\u201cThe catch is that The Seeker can still guess<\/em>. Even if it only sees a hash, it can look at the timing, the pattern, the context. If a thousand hashes show up in the mempool at exactly the moment a popular artifact sale goes live, The Seeker can assume that many of those hashes are purchase attempts.\u201d<\/p>\n\n\n\n

Jesse frowned. \u201cSo it just guesses which hashes are for the sale?\u201d<\/p>\n\n\n\n

\u201cWorse. It can submit its own hashes\u2014its own commitments\u2014for the same artifact. Then, when the reveal phase happens, it reveals actual purchase transactions. If any of its hashes ended up ahead of yours in the ordering, it still wins.\u201d<\/p>\n\n\n\n

\u201cBut it doesn\u2019t know which hash corresponds to which transaction.\u201d<\/p>\n\n\n\n

\u201cIt doesn\u2019t need to. It just floods the zone with hashes, just like it flooded the zone with transactions in the simulation. The VRF ordering makes it harder, but not impossible.\u201d Nia pulled up another simulation. \u201cWatch.\u201d<\/p>\n\n\n\n

She ran a model where The Seeker submitted fifty hashes for every real user\u2019s hash. The VRF ordering scattered them randomly. Statistically, The Seeker\u2019s hashes occupied about fifty percent of the top positions\u2014enough to capture a significant share of the limited artifacts.<\/p>\n\n\n\n

\u201cSo commit-reveal alone isn\u2019t enough,\u201d Jesse said. \u201cIt slows The Seeker down, but it doesn\u2019t stop it.\u201d<\/p>\n\n\n\n

\u201cIt doesn\u2019t stop it. And there\u2019s an even worse vulnerability.\u201d Nia\u2019s voice dropped. \u201cThe Seeker can also try to crack<\/em> the hashes.\u201d<\/p>\n\n\n\n

Jesse\u2019s blood went cold. \u201cCrack them? I thought hashes were irreversible.\u201d<\/p>\n\n\n\n

\u201cThey are, in theory. But if the space of possible transactions is small, The Seeker can brute-force guess. For example, an artifact sale has a known recipient address and a known price\u201450 credits. The only thing that changes is the buyer\u2019s address. That\u2019s a small space. The Seeker could generate hashes for every possible buyer address and compare them to the hashes in the mempool.\u201d<\/p>\n\n\n\n

\u201cThat\u2019s\u2026 terrifying.\u201d<\/p>\n\n\n\n

\u201cIt\u2019s impractical for large, complex transactions. But for simple purchases like artifact drops? Absolutely feasible.\u201d Nia pulled up a research paper titled \u201cPractical Hash Cracking in Blockchain Mempools.\u201d<\/em> \u201cThis was published six months ago. The authors demonstrated that a bot with moderate computing power could identify about forty percent of commit-reveal transactions within ten seconds.\u201d<\/p>\n\n\n\n

Jesse stood up. Started pacing. \u201cSo commit-reveal is better than nothing, but it\u2019s not a solution. The Seeker can still guess, still spam, still crack.\u201d<\/p>\n\n\n\n

\u201cThat\u2019s why we need the third piece,\u201d Nia said. \u201cThe encrypted mempool.\u201d<\/p>\n\n\n\n

\n\n\n\n

Scene 4: The Trio of Fixes<\/strong><\/p>\n\n\n\n

Jesse walked to the whiteboard and picked up the marker. Underneath the commit-reveal diagram, he wrote:<\/p>\n\n\n\n

PROBLEM 1: Visible transactions \u2192 SOLVED BY?<\/strong> (VRF ordering partially, but not fully)
PROBLEM 2: Guessing and spamming hashes \u2192 SOLVED BY?<\/strong> (Commit-reveal partially, but not fully)
PROBLEM 3: The Seeker adapts \u2192 SOLVED BY?<\/strong> (???)<\/p>\n\n\n\n

He turned to Nia. \u201cWe need all three layers working together. VRF ordering makes the order unpredictable. Commit-reveal hides the transaction contents until after ordering. Encrypted mempool makes it impossible for The Seeker to even see the hashes until it\u2019s too late.\u201d<\/p>\n\n\n\n

\u201cBut encryption adds another problem,\u201d Nia said. \u201cIf the mempool is encrypted, how do validators know which transactions to include? They can\u2019t read anything.\u201d<\/p>\n\n\n\n

\u201cTime-lock encryption,\u201d Jesse said, remembering Cipher\u2019s explanation from weeks ago. \u201cTransactions are encrypted with a key that only becomes available after the block is finalized. Validators order the encrypted bundles without seeing inside. Then, after the order is locked, the encryption unlocks and they execute.\u201d<\/p>\n\n\n\n

Nia stared at him. \u201cYou actually remember that?\u201d<\/p>\n\n\n\n

\u201cI\u2019ve been paying attention.\u201d Jesse wrote on the whiteboard:<\/p>\n\n\n\n

THE TRIO OF FIXES<\/strong><\/p>\n\n\n\n

    \n
  1. VRF Ordering<\/strong>\u00a0\u2192 Unpredictable sequence<\/li>\n\n\n\n
  2. Commit-Reveal<\/strong>\u00a0\u2192 Hidden intent<\/li>\n\n\n\n
  3. Encrypted Mempool<\/strong>\u00a0\u2192 Complete blindness until it\u2019s too late<\/li>\n<\/ol>\n\n\n\n

    \u201cAll three,\u201d he said. \u201cNot one, not two. All three.\u201d<\/p>\n\n\n\n

    Nia was quiet for a long moment. Then she smiled\u2014a real smile, the kind Jesse had only seen once or twice before.<\/p>\n\n\n\n

    \u201cYou\u2019re not a coder,\u201d she said. \u201cBut you think like an architect.\u201d<\/p>\n\n\n\n

    \u201cI think like someone who\u2019s tired of losing.\u201d<\/p>\n\n\n\n

    \n\n\n\n

    They spent the rest of the evening sketching out how the three layers would work together. Nia did the technical heavy lifting\u2014the cryptographic primitives, the network protocols, the performance trade-offs. Jesse asked the hard questions: What if this fails? What if The Seeker does that? How do we know this is enough?<\/em><\/p>\n\n\n\n

    By midnight, they had a rough design.<\/p>\n\n\n\n

    Layer 1 (Mempool Entry):<\/strong> User generates a transaction, encrypts it with a time-lock key set to the next block height. User submits the encrypted transaction to the mempool.<\/p>\n\n\n\n

    Layer 2 (Ordering):<\/strong> Validators collect encrypted transactions. They apply a commit-reveal scheme\u2014hashing the encrypted bundles\u2014and order the hashes using VRF. The order is locked.<\/p>\n\n\n\n

    Layer 3 (Execution):<\/strong> The block is finalized. The time-lock key becomes available. Validators decrypt the transactions and execute them in the locked order.<\/p>\n\n\n\n

    \u201cThe Seeker sees nothing but encrypted garbage until after the block is done,\u201d Nia said. \u201cBy then, the sword is already sold. To you.\u201d<\/p>\n\n\n\n

    \u201cTo me,\u201d Jesse said, imagining the Emberheart in his display frame.<\/p>\n\n\n\n

    \u201cTo everyone.\u201d<\/p>\n\n\n\n

    \n\n\n\n

    Nia\u2019s phone buzzed on the desk.<\/p>\n\n\n\n

    It was after midnight. Who would be texting at this hour? Jesse glanced at the screen. The caller ID showed a name he didn\u2019t recognize: Cipher_Actual<\/em>.<\/p>\n\n\n\n

    Nia picked up the phone. Read the message. Her face went pale.<\/p>\n\n\n\n

    \u201cWhat is it?\u201d Jesse asked.<\/p>\n\n\n\n

    She turned the phone toward him. The message was short:<\/p>\n\n\n\n

    \u201cThe Seeker just expanded. It\u2019s now scanning for commit hashes and brute-forcing guesses. We need encryption. Now.\u201d<\/em><\/p>\n\n\n\n

    Jesse\u2019s stomach dropped. \u201cHow does Cipher know?\u201d<\/p>\n\n\n\n

    \u201cCipher monitors the mempool constantly. They have their own sensors\u2014nodes that watch for bot activity.\u201d Nia was already typing a reply. \u201cThis is what I was afraid of. The Seeker isn\u2019t waiting. It\u2019s adapting. Right now, while we\u2019re sitting here drawing diagrams, it\u2019s learning how to crack commit-reveal.\u201d<\/p>\n\n\n\n

    \u201cBut we haven\u2019t even deployed commit-reveal yet. It\u2019s just a testnet.\u201d<\/p>\n\n\n\n

    \u201cDoesn\u2019t matter. The Seeker is training itself. By the time we\u2019re ready to deploy, it\u2019ll already know how to beat us.\u201d Nia stood up abruptly. \u201cWe can\u2019t wait. We need to build the encrypted mempool now. Not next month. Not next week. Now.\u201d<\/p>\n\n\n\n

    Jesse looked at the whiteboard. The trio of fixes. Layer three\u2014the hardest piece\u2014was still just a sketch. They hadn\u2019t written a single line of code. They hadn\u2019t even agreed on which encryption scheme to use.<\/p>\n\n\n\n

    \u201cCan we do it?\u201d he asked.<\/p>\n\n\n\n

    \u201cI don\u2019t know.\u201d Nia\u2019s voice was barely a whisper. \u201cBut we have to try.\u201d<\/p>\n\n\n\n

    \n\n\n\n

    She called Cipher. It was 12:30 AM, but Cipher answered on the first ring.<\/p>\n\n\n\n

    \u201cYou saw the message,\u201d Cipher said.<\/p>\n\n\n\n

    \u201cWe saw it,\u201d Nia replied. \u201cHow bad is it?\u201d<\/p>\n\n\n\n

    \u201cBad. The Seeker\u2019s operators have deployed a new module specifically designed to analyze commit-reveal patterns. It\u2019s not just guessing anymore\u2014it\u2019s using machine learning to predict which hashes correspond to which transactions based on timing, network latency, and historical data.\u201d<\/p>\n\n\n\n

    \u201cMachine learning?\u201d Jesse said. \u201cIt\u2019s teaching itself to front-run?\u201d<\/p>\n\n\n\n

    \u201cThat\u2019s exactly what it\u2019s doing.\u201d Cipher\u2019s voice modulator made them sound distant, almost mechanical. \u201cThe people running The Seeker are not amateurs. They have resources\u2014computing power, data scientists, probably a dozen engineers. Every day we wait, they get smarter.\u201d<\/p>\n\n\n\n

    Nia paced the small apartment. The validator nodes hummed, indifferent to the crisis unfolding around them.<\/p>\n\n\n\n

    \u201cWhat do you recommend?\u201d she asked.<\/p>\n\n\n\n

    \u201cAccelerate the timeline. The Fair Sequencing DAO needs to vote on funding for the encrypted mempool research. No more testnets. No more prototypes. We need a production-ready implementation within six weeks.\u201d<\/p>\n\n\n\n

    \u201cSix weeks?\u201d Nia stopped pacing. \u201cThat\u2019s impossible.\u201d<\/p>\n\n\n\n

    \u201cThen the network dies.\u201d Cipher\u2019s voice was flat. \u201cI\u2019m not being dramatic. If The Seeker figures out how to break commit-reveal at scale, front-running will become worse than ever. Users will flee. Validators will go bankrupt. The only ones left will be the bots and the people who control them.\u201d<\/p>\n\n\n\n

    Jesse stepped closer to the phone. \u201cWhat about the other DAO members? BlockGuild? ValleyValidator? Will they support this?\u201d<\/p>\n\n\n\n

    Cipher was silent for a moment. \u201cBlockGuild will oppose it. He\u2019ll say it\u2019s too expensive, too risky, too untested. He may even leave the DAO entirely and join QuickPath.\u201d<\/p>\n\n\n\n

    \u201cAnd the others?\u201d<\/p>\n\n\n\n

    \u201cSome will follow BlockGuild. Some will stay. The question is whether the ones who stay are enough to build what we need.\u201d Cipher paused. \u201cI\u2019ll call an emergency meeting for tomorrow night. Be ready.\u201d<\/p>\n\n\n\n

    The call ended.<\/p>\n\n\n\n

    \n\n\n\n

    Jesse and Nia sat in silence. The whiteboard glowed under the desk lamp\u2014the trio of fixes, now urgent, now desperate.<\/p>\n\n\n\n

    \u201cSix weeks,\u201d Jesse said.<\/p>\n\n\n\n

    \u201cSix weeks,\u201d Nia repeated. \u201cTo build something that usually takes six months.\u201d<\/p>\n\n\n\n

    \u201cCan we do it?\u201d<\/p>\n\n\n\n

    Nia looked at him. Her eyes were red\u2014from exhaustion, from stress, from the weight of everything pressing down on her.<\/p>\n\n\n\n

    \u201cI don\u2019t know,\u201d she said. \u201cBut I\u2019m not going to stop trying. Are you?\u201d<\/p>\n\n\n\n

    Jesse thought about the empty display frame. The sword he still didn\u2019t have. The Seeker, out there in the dark, learning, adapting, growing stronger every day.<\/p>\n\n\n\n

    \u201cNo,\u201d he said. \u201cI\u2019m not stopping.\u201d<\/p>\n\n\n\n

    Nia nodded. She pulled out her laptop and opened a new document. At the top, she typed:<\/p>\n\n\n\n

    ENCRYPTED MEMPOOL – EMERGENCY IMPLEMENTATION PLAN<\/strong><\/p>\n\n\n\n

    Underneath, she wrote a single line:<\/p>\n\n\n\n

    Failure is not an option. The Seeker is counting on it.<\/em><\/p>\n\n\n\n

    Then she looked at Jesse. \u201cYou should go home. Get some sleep. Tomorrow is going to be a long day.\u201d<\/p>\n\n\n\n

    Jesse stood up. Gathered his notebook, his phone, his jacket. At the door, he turned back.<\/p>\n\n\n\n

    \u201cNia.\u201d<\/p>\n\n\n\n

    \u201cYeah?\u201d<\/p>\n\n\n\n

    \u201cWe\u2019re going to win.\u201d<\/p>\n\n\n\n

    She smiled\u2014tired, fragile, but real. \u201cYeah,\u201d she said. \u201cWe are.\u201d<\/p>\n\n\n\n

    Jesse walked out into the night. The street was empty, the sky clear, the stars hidden behind city lights. Somewhere out there, The Seeker was scanning, guessing, cracking.<\/p>\n\n\n\n

    But somewhere in a small apartment across town, two people and a mysterious ally were building the weapon that would finally blind it.<\/p>\n\n\n\n

    The war had begun.<\/p>\n\n\n\n

    Table of contents:<\/em><\/strong>
    Introduction<\/a>
    Chapter 1: The Mempool<\/a>
    Chapter 2: A Transaction in the Dark<\/a>
    Chapter 3: The Gas Auction<\/a>
    Chapter 4: The Sandwich Attack<\/a>
    Chapter 5: The Priority Fee War<\/a>
    Chapter 6: A Fair Ordering Protocol<\/a>
    Chapter 7: The Commit-Reveal Scheme<\/a>
    Chapter 8: The Encrypted Mempool<\/a> <<<<<< NEXT<\/strong>
    Chapter 9: The Time-Weighted Consensus<\/a>
    Chapter 10: A Just Sequence<\/a><\/p>\n

    <\/div>

    <\/path><\/svg><\/i> \"Loading\"<\/p>

    <\/div>","protected":false},"excerpt":{"rendered":"

    The testnet ran for eleven days without a single front-running attack. Jesse checked it every […]<\/p>\n

    <\/div>\n

    <\/path><\/svg><\/i> \"Loading\"<\/p>\n

    <\/div>\n","protected":false},"author":2,"featured_media":0,"comment_status":"closed","ping_status":"closed","sticky":false,"template":"","format":"standard","meta":{"footnotes":""},"categories":[60292],"tags":[60332,58994,60293,58992,60294,60295,60333,60335,60334,60297,60296,60336,61157,61158,61159,61160,61161,61163,61162,60330,60331],"class_list":["post-60869","post","type-post","status-publish","format-standard","hentry","category-science-fiction","tag-children-novel","tag-crypto","tag-crypto-story","tag-cryptocurrency","tag-cryptocurrency-story","tag-science-fiction","tag-science-fiction-novel","tag-science-fiction-novel-for-children","tag-science-fiction-novel-for-young-adult","tag-science-fiction-story","tag-science-fiction-story-for-children","tag-science-fiction-story-for-young-adult","tag-the-front-running-fencer","tag-the-front-running-fencer-science-fiction-novel","tag-the-front-running-fencer-science-fiction-novel-for-children","tag-the-front-running-fencer-science-fiction-novel-for-young-adult","tag-the-front-running-fencer-science-fiction-story","tag-the-front-running-fencer-science-fiction-story-for-children","tag-the-front-running-fencer-science-fiction-story-for-young-adult","tag-ya-novel","tag-young-adult-novel"],"_links":{"self":[{"href":"https:\/\/nightfame.com\/style\/wp-json\/wp\/v2\/posts\/60869","targetHints":{"allow":["GET"]}}],"collection":[{"href":"https:\/\/nightfame.com\/style\/wp-json\/wp\/v2\/posts"}],"about":[{"href":"https:\/\/nightfame.com\/style\/wp-json\/wp\/v2\/types\/post"}],"author":[{"embeddable":true,"href":"https:\/\/nightfame.com\/style\/wp-json\/wp\/v2\/users\/2"}],"replies":[{"embeddable":true,"href":"https:\/\/nightfame.com\/style\/wp-json\/wp\/v2\/comments?post=60869"}],"version-history":[{"count":2,"href":"https:\/\/nightfame.com\/style\/wp-json\/wp\/v2\/posts\/60869\/revisions"}],"predecessor-version":[{"id":60900,"href":"https:\/\/nightfame.com\/style\/wp-json\/wp\/v2\/posts\/60869\/revisions\/60900"}],"wp:attachment":[{"href":"https:\/\/nightfame.com\/style\/wp-json\/wp\/v2\/media?parent=60869"}],"wp:term":[{"taxonomy":"category","embeddable":true,"href":"https:\/\/nightfame.com\/style\/wp-json\/wp\/v2\/categories?post=60869"},{"taxonomy":"post_tag","embeddable":true,"href":"https:\/\/nightfame.com\/style\/wp-json\/wp\/v2\/tags?post=60869"}],"curies":[{"name":"wp","href":"https:\/\/api.w.org\/{rel}","templated":true}]}}