kiosk-pow-argon2id 0.5.20

checksums.yaml

@@ -0,0 +1,7 @@
+---
+SHA256:
+  metadata.gz: 709ee4dba79e300408bf97a52dda423b9b4e20a5d7833c8f91bae88869dbf177
+  data.tar.gz: e77cb6aef216454e9b134c6d82c670005f2f8b84bda22cbcfd39c84eaf298d1b
+SHA512:
+  metadata.gz: 9a7ba3f796b69a89162bbe4a7d215defefdedd6416c8575a07a34b2451daee6ec3e2317158a3b569768fd81144f8e524a32048034eb2d3c263a0d9c27538471e
+  data.tar.gz: 3cab71fce366c4fe540ee26694010552a881ac65c38179aa513f6a875e07f3a32e958446cdf04541d703c2926e271f12e2167097fcfc227deaebb3b35bf0394d

data/CHANGELOG.md

@@ -0,0 +1,33 @@
+# Changelog
+
+All notable changes follow [Keep a Changelog](https://keepachangelog.com/en/1.1.0/) and [Semantic Versioning](https://semver.org/).
+
+How to write an entry, and what a release section means: `CHANGELOG-RULE.md` at
+the root of this repository —
+<https://github.com/kiosk-hq/kiosk/blob/main/CHANGELOG-RULE.md>. In short: under
+200 characters, one or two sentences, the essence rather than the content; write it
+under `## [Unreleased]`; a cut renames that heading to
+`## [MAJOR.MINOR.PATCH] — <date>` and opens a fresh empty one above it; nothing
+already written is edited.
+
+## [Unreleased]
+
+## [0.5.20] — 2026-10-20
+
+- 2026-10-20: Version 0.5.20, the tree cut that matches skill 0.5.20.
+
+## [0.5.19] — 2026-10-20
+
+- 2026-10-20: Version 0.5.19, the tree cut that matches skill 0.5.19.
+
+## [0.5.18] — 2026-10-18
+
+- 2026-10-18: Version 0.5.18, the tree cut that matches skill 0.5.18.
+
+## [0.5.17] — 2026-10-18
+
+- 2026-10-18: Version 0.5.17, the tree cut that matches skill 0.5.17.
+
+## [0.5.16] — 2026-10-18
+
+- 2026-10-18: The Argon2id backend moves here from kiosk-pow, as `Kiosk::Pow::Argon2id`. It is built on kiosk-pow.

data/LICENSE.txt

@@ -0,0 +1,202 @@
+
+                                 Apache License
+                           Version 2.0, January 2004
+                        http://www.apache.org/licenses/
+
+   TERMS AND CONDITIONS FOR USE, REPRODUCTION, AND DISTRIBUTION
+
+   1. Definitions.
+
+      "License" shall mean the terms and conditions for use, reproduction,
+      and distribution as defined by Sections 1 through 9 of this document.
+
+      "Licensor" shall mean the copyright owner or entity authorized by
+      the copyright owner that is granting the License.
+
+      "Legal Entity" shall mean the union of the acting entity and all
+      other entities that control, are controlled by, or are under common
+      control with that entity. For the purposes of this definition,
+      "control" means (i) the power, direct or indirect, to cause the
+      direction or management of such entity, whether by contract or
+      otherwise, or (ii) ownership of fifty percent (50%) or more of the
+      outstanding shares, or (iii) beneficial ownership of such entity.
+
+      "You" (or "Your") shall mean an individual or Legal Entity
+      exercising permissions granted by this License.
+
+      "Source" form shall mean the preferred form for making modifications,
+      including but not limited to software source code, documentation
+      source, and configuration files.
+
+      "Object" form shall mean any form resulting from mechanical
+      transformation or translation of a Source form, including but
+      not limited to compiled object code, generated documentation,
+      and conversions to other media types.
+
+      "Work" shall mean the work of authorship, whether in Source or
+      Object form, made available under the License, as indicated by a
+      copyright notice that is included in or attached to the work
+      (an example is provided in the Appendix below).
+
+      "Derivative Works" shall mean any work, whether in Source or Object
+      form, that is based on (or derived from) the Work and for which the
+      editorial revisions, annotations, elaborations, or other modifications
+      represent, as a whole, an original work of authorship. For the purposes
+      of this License, Derivative Works shall not include works that remain
+      separable from, or merely link (or bind by name) to the interfaces of,
+      the Work and Derivative Works thereof.
+
+      "Contribution" shall mean any work of authorship, including
+      the original version of the Work and any modifications or additions
+      to that Work or Derivative Works thereof, that is intentionally
+      submitted to Licensor for inclusion in the Work by the copyright owner
+      or by an individual or Legal Entity authorized to submit on behalf of
+      the copyright owner. For the purposes of this definition, "submitted"
+      means any form of electronic, verbal, or written communication sent
+      to the Licensor or its representatives, including but not limited to
+      communication on electronic mailing lists, source code control systems,
+      and issue tracking systems that are managed by, or on behalf of, the
+      Licensor for the purpose of discussing and improving the Work, but
+      excluding communication that is conspicuously marked or otherwise
+      designated in writing by the copyright owner as "Not a Contribution."
+
+      "Contributor" shall mean Licensor and any individual or Legal Entity
+      on behalf of whom a Contribution has been received by Licensor and
+      subsequently incorporated within the Work.
+
+   2. Grant of Copyright License. Subject to the terms and conditions of
+      this License, each Contributor hereby grants to You a perpetual,
+      worldwide, non-exclusive, no-charge, royalty-free, irrevocable
+      copyright license to reproduce, prepare Derivative Works of,
+      publicly display, publicly perform, sublicense, and distribute the
+      Work and such Derivative Works in Source or Object form.
+
+   3. Grant of Patent License. Subject to the terms and conditions of
+      this License, each Contributor hereby grants to You a perpetual,
+      worldwide, non-exclusive, no-charge, royalty-free, irrevocable
+      (except as stated in this section) patent license to make, have made,
+      use, offer to sell, sell, import, and otherwise transfer the Work,
+      where such license applies only to those patent claims licensable
+      by such Contributor that are necessarily infringed by their
+      Contribution(s) alone or by combination of their Contribution(s)
+      with the Work to which such Contribution(s) was submitted. If You
+      institute patent litigation against any entity (including a
+      cross-claim or counterclaim in a lawsuit) alleging that the Work
+      or a Contribution incorporated within the Work constitutes direct
+      or contributory patent infringement, then any patent licenses
+      granted to You under this License for that Work shall terminate
+      as of the date such litigation is filed.
+
+   4. Redistribution. You may reproduce and distribute copies of the
+      Work or Derivative Works thereof in any medium, with or without
+      modifications, and in Source or Object form, provided that You
+      meet the following conditions:
+
+      (a) You must give any other recipients of the Work or
+          Derivative Works a copy of this License; and
+
+      (b) You must cause any modified files to carry prominent notices
+          stating that You changed the files; and
+
+      (c) You must retain, in the Source form of any Derivative Works
+          that You distribute, all copyright, patent, trademark, and
+          attribution notices from the Source form of the Work,
+          excluding those notices that do not pertain to any part of
+          the Derivative Works; and
+
+      (d) If the Work includes a "NOTICE" text file as part of its
+          distribution, then any Derivative Works that You distribute must
+          include a readable copy of the attribution notices contained
+          within such NOTICE file, excluding those notices that do not
+          pertain to any part of the Derivative Works, in at least one
+          of the following places: within a NOTICE text file distributed
+          as part of the Derivative Works; within the Source form or
+          documentation, if provided along with the Derivative Works; or,
+          within a display generated by the Derivative Works, if and
+          wherever such third-party notices normally appear. The contents
+          of the NOTICE file are for informational purposes only and
+          do not modify the License. You may add Your own attribution
+          notices within Derivative Works that You distribute, alongside
+          or as an addendum to the NOTICE text from the Work, provided
+          that such additional attribution notices cannot be construed
+          as modifying the License.
+
+      You may add Your own copyright statement to Your modifications and
+      may provide additional or different license terms and conditions
+      for use, reproduction, or distribution of Your modifications, or
+      for any such Derivative Works as a whole, provided Your use,
+      reproduction, and distribution of the Work otherwise complies with
+      the conditions stated in this License.
+
+   5. Submission of Contributions. Unless You explicitly state otherwise,
+      any Contribution intentionally submitted for inclusion in the Work
+      by You to the Licensor shall be under the terms and conditions of
+      this License, without any additional terms or conditions.
+      Notwithstanding the above, nothing herein shall supersede or modify
+      the terms of any separate license agreement you may have executed
+      with Licensor regarding such Contributions.
+
+   6. Trademarks. This License does not grant permission to use the trade
+      names, trademarks, service marks, or product names of the Licensor,
+      except as required for reasonable and customary use in describing the
+      origin of the Work and reproducing the content of the NOTICE file.
+
+   7. Disclaimer of Warranty. Unless required by applicable law or
+      agreed to in writing, Licensor provides the Work (and each
+      Contributor provides its Contributions) on an "AS IS" BASIS,
+      WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or
+      implied, including, without limitation, any warranties or conditions
+      of TITLE, NON-INFRINGEMENT, MERCHANTABILITY, or FITNESS FOR A
+      PARTICULAR PURPOSE. You are solely responsible for determining the
+      appropriateness of using or redistributing the Work and assume any
+      risks associated with Your exercise of permissions under this License.
+
+   8. Limitation of Liability. In no event and under no legal theory,
+      whether in tort (including negligence), contract, or otherwise,
+      unless required by applicable law (such as deliberate and grossly
+      negligent acts) or agreed to in writing, shall any Contributor be
+      liable to You for damages, including any direct, indirect, special,
+      incidental, or consequential damages of any character arising as a
+      result of this License or out of the use or inability to use the
+      Work (including but not limited to damages for loss of goodwill,
+      work stoppage, computer failure or malfunction, or any and all
+      other commercial damages or losses), even if such Contributor
+      has been advised of the possibility of such damages.
+
+   9. Accepting Warranty or Additional Liability. While redistributing
+      the Work or Derivative Works thereof, You may choose to offer,
+      and charge a fee for, acceptance of support, warranty, indemnity,
+      or other liability obligations and/or rights consistent with this
+      License. However, in accepting such obligations, You may act only
+      on Your own behalf and on Your sole responsibility, not on behalf
+      of any other Contributor, and only if You agree to indemnify,
+      defend, and hold each Contributor harmless for any liability
+      incurred by, or claims asserted against, such Contributor by reason
+      of your accepting any such warranty or additional liability.
+
+   END OF TERMS AND CONDITIONS
+
+   APPENDIX: How to apply the Apache License to your work.
+
+      To apply the Apache License to your work, attach the following
+      boilerplate notice, with the fields enclosed by brackets "[]"
+      replaced with your own identifying information. (Don't include
+      the brackets!)  The text should be enclosed in the appropriate
+      comment syntax for the file format. We also recommend that a
+      file or class name and description of purpose be included on the
+      same "printed page" as the copyright notice for easier
+      identification within third-party archives.
+
+   Copyright [yyyy] [name of copyright owner]
+
+   Licensed under the Apache License, Version 2.0 (the "License");
+   you may not use this file except in compliance with the License.
+   You may obtain a copy of the License at
+
+       http://www.apache.org/licenses/LICENSE-2.0
+
+   Unless required by applicable law or agreed to in writing, software
+   distributed under the License is distributed on an "AS IS" BASIS,
+   WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied.
+   See the License for the specific language governing permissions and
+   limitations under the License.

data/README.md

@@ -0,0 +1,168 @@
+# kiosk-pow-argon2id
+
+Argon2id memory-hard proof-of-work backend for the [Kiosk](https://kiosk.tech) framework.
+
+> **Retired / optional.** The shipped default PoW backend is
+> [`kiosk-pow-equihash`](https://github.com/kiosk-hq/kiosk/tree/main/kiosk-pow-equihash) — one PoW backend, Equihash.
+> Argon2id's `verify` costs one `m`-sized eval (~64 MiB),
+> so a flood of bad proofs is a DoS on the *verifier* — the exact failure the
+> asymmetric-verify goal exists to prevent. This gem stays in the repo as an
+> opt-in backend and reference; no demo, harness or deploy runbook wires it.
+
+## What it is
+
+`kiosk-pow-argon2id` implements a
+**search-form Argon2id PoW**: a client finds the smallest nonce `n ≥ 0` such
+that `Argon2id(password=str(n), salt=raw_salt, ...)` has ≥ `d` leading zero
+bits. The provider verifies by computing **one** Argon2id eval — the solve:verify
+lever is exactly `2^d`.
+
+Providers can demand this PoW on any query or action endpoint
+(`GET /kiosk/<query-name>`, `POST /kiosk/<action-name>`) — and, as an optional
+registration toll, on `/kiosk/auth/register` — at their discretion, via
+`kiosk-reputation`'s policy layer. `pay` is tolled the same way, so it may
+answer `402 pow_required`; it answers `402 payment_setup_required` when the
+customer has no saved card. `kiosk-pow-argon2id` ships both sides:
+
+- **Ruby verify** (`Kiosk::Pow::Argon2id.verify`) — one Argon2id eval, no loop.
+- **Python solver** (`solve.py`) — an assistant runs this in its sandbox when
+  it receives a `pow_required` challenge. Pure `argon2-cffi`, no exotic deps.
+
+Both sides produce byte-identical Argon2id digests (verified by `rake parity`).
+
+## Ruby API
+
+```ruby
+# Challenge params for a difficulty tier:
+Kiosk::Pow::Argon2id.params(d: 8)
+# => { m: 65_536, t: 1, p: 1, d: 8 }
+
+# Check one proof (one Argon2id eval — no loop):
+Kiosk::Pow::Argon2id.verify(salt: raw_bytes, params: { m: 65_536, t: 1, p: 1, d: 8 }, nonce: "73821")
+# => true / false
+
+# Raw 32-byte digest:
+Kiosk::Pow::Argon2id.digest(salt: raw_bytes, params: { m: 65_536, t: 1, p: 1, d: 8 }, nonce: "0")
+```
+
+### Constants and defaults
+
+| Symbol | Value | Meaning |
+|--------|-------|---------|
+| `Kiosk::Pow::Argon2id::NAME` | `"argon2id"` | Algorithm name advertised in the wire challenge |
+| `m` default | `65_536` KiB (64 MiB) | ASIC-resistance knob; sets verify cost and solve cost equally |
+| `t` default | `1` | Iterations |
+| `p` default | `1` | Parallelism |
+| `d` | provider-chosen | Required leading zero bits; escalation knob; solve ≈ `2^d` evals |
+
+## The canonical PoW computation
+
+Both the Ruby verifier and the Python solver compute the same primitive:
+
+```
+Argon2id(
+  password = str(nonce),       # decimal ASCII string, e.g. "0", "73821"
+  salt     = raw_salt_bytes,   # ≥ 8 raw bytes; wire base64 decoded upstream
+  m_cost   = params[:m],       # memory in KiB (default 65 536 = 64 MiB)
+  t_cost   = params[:t],       # iterations (default 1)
+  p        = params[:p],       # parallelism (default 1)
+  version  = 0x13,             # ARGON2_VERSION_13 (19) — hardcoded both sides
+  hash_len = 32                # 32-byte output
+)
+```
+
+A nonce is valid iff `leading_zero_bits(digest) >= params[:d]`.
+
+Ruby uses `Argon2::Ext.argon2id_hash_raw` (libargon2, always version `0x13`).
+Python uses `argon2.low_level.hash_secret_raw(..., version=19)` (`argon2-cffi`).
+Version `19` decimal == `0x13` hex — byte-identical output.
+
+## Wire challenge params
+
+The `params` object in the challenge carries exactly four integer keys:
+
+| Key | Type | Meaning |
+|-----|------|---------|
+| `m` | Integer | Memory in KiB |
+| `t` | Integer | Iterations |
+| `p` | Integer | Parallelism |
+| `d` | Integer | Required leading zero bits |
+
+## Python solver
+
+```bash
+pip install argon2-cffi
+
+python3 solve.py '{"salt":"<base64>","params":{"m":65536,"t":1,"p":1,"d":8}}'
+# stdout: {"nonce": "73821"}
+```
+
+`solve.py` accepts the challenge JSON as `sys.argv[1]` or reads it from stdin.
+It only reads `"salt"` and `"params"` from the challenge — the other fields
+(`id`, `alg`, `exp`, `sig`) are ignored, so the full challenge object is safe
+to pass directly.
+
+Agent-facing guidance is **not** duplicated in this gem. The canonical skill is
+[kiosk.tech/skill.md](https://kiosk.tech/skill.md); it teaches the `402
+pow_required` retry — the same request body, unchanged, with the proof(s) in a
+`Kiosk-PoW` request header as raw JSON — and it teaches it for the
+shipped Equihash default, not for this legacy backend. An operator that opts
+back into Argon2id is off that path: it must tell its own assistants to run the
+`solve.py` above and echo the challenge verbatim in the `Kiosk-PoW` header.
+
+## Difficulty tiers (guidance)
+
+Solve time depends on `m` and the assistant's hardware. Defaults: `m = 65 536`
+KiB (64 MiB), `t = 1`, `p = 1`.
+
+| `d` | Expected solve time | Typical use |
+|----:|:-------------------:|:------------|
+| 0   | instant             | no challenge (policy returns nil) |
+| 5–6 | 2–4 s               | light friction for unproven principals |
+| 8   | 20–40 s             | medium throttle |
+| 11  | 3–6 min             | hard throttle for high-suspicion/high-rate |
+
+These are guidance on server-class compute; actual times vary.
+
+## Cross-implementation parity check
+
+```bash
+bundle exec rake parity
+```
+
+Computes the same Argon2id digest in Ruby and Python, asserts hex-equal, then
+runs `solve.py` on a small challenge and asserts Ruby `verify` accepts the
+result. Run this after any change to either implementation.
+
+## Installation
+
+> **Not on RubyGems yet** — so every `gem` line below carries `github: "kiosk-hq/kiosk"`, which is what makes it copy-pasteable today. Publication status and the canonical install are stated once, in the monorepo README's [Install](https://github.com/kiosk-hq/kiosk#install) section.
+
+```ruby
+gem "kiosk-pow-argon2id", github: "kiosk-hq/kiosk"
+```
+
+```ruby
+require "kiosk/pow/argon2id"
+
+# Register with kiosk-reputation (if using the policy layer):
+Kiosk::Reputation::Backends.register("argon2id", Kiosk::Pow::Argon2id)
+```
+
+## Honesty / guardrails
+
+- **PoW is economic friction, not a wall.** A determined ASIC attacker still
+  gets in; the point is to make free-riding cost more than buying. Combine with
+  `kiosk-reputation` for the full picture.
+- **The provider mandates `alg` + `params`.** Clients comply or are denied.
+  There is no negotiation path — do not add one.
+- **Default verify costs `m` KiB of memory** — one full Argon2id eval.
+  Only challenge on suspicion/rate, not on every cheap call. The challenge
+  should protect a value worth more than the verify cost.
+- **`m` is the ASIC-resistance knob; `d` is the difficulty knob.** Raising `m`
+  raises solve and verify equally (lever unchanged). Raising `d` raises solve
+  exponentially while verify stays one eval.
+
+## License
+
+Apache-2.0. See [LICENSE.txt](LICENSE.txt).

data/lib/kiosk/pow/argon2id/version.rb

@@ -0,0 +1,9 @@
+# frozen_string_literal: true
+
+module Kiosk
+  module Pow
+    module Argon2id
+      VERSION = '0.5.20'
+    end
+  end
+end

data/lib/kiosk/pow/argon2id.rb

@@ -0,0 +1,55 @@
+# frozen_string_literal: true
+
+require 'ffi'
+require 'argon2'
+
+require 'kiosk/pow'
+require_relative 'argon2id/version'
+
+module Kiosk
+  module Pow
+    # Argon2id memory-hard proof-of-work backend, dispatched by kiosk-reputation for "argon2id".
+    # A nonce is valid iff leading_zero_bits(Argon2id(nonce.to_s, salt, m, t, p, v=0x13, 32 bytes)) >= d,
+    # byte-identical to the Python solver.
+    module Argon2id
+      NAME = 'argon2id'
+      DIGEST_BYTES = 32
+
+      # d: required leading zero bits; m: memory in KiB.
+      def self.params(d:, m: 65_536, t: 1, p: 1) # rubocop:disable Naming/MethodParameterName -- m, t, p and d are the wire params keys.
+        { m:, t:, p:, d: }
+      end
+
+      def self.digest(salt:, params:, nonce:)
+        buffer = FFI::MemoryPointer.new(:char, DIGEST_BYTES)
+        argon2id_hash_raw(salt, params, nonce.to_s.b, buffer)
+        buffer.read_string(DIGEST_BYTES)
+      ensure
+        buffer&.free
+      end
+
+      # Raw libargon2 call: the Password API would turn m_cost into a power-of-two exponent.
+      def self.argon2id_hash_raw(salt, params, password, buffer)
+        memory, time, lanes = params.values_at(:m, :t, :p).map { Integer(it) }
+        ret = Argon2::Ext.argon2id_hash_raw(time, memory, lanes, password, password.bytesize,
+                                            salt, salt.bytesize, buffer, DIGEST_BYTES)
+        raise "Argon2id evaluation failed (code #{ret})" unless ret.zero?
+      end
+      private_class_method :argon2id_hash_raw
+
+      def self.verify(salt:, params:, nonce:) # rubocop:disable Naming/PredicateMethod -- the PoW backend interface name.
+        leading_zero_bits(digest(salt:, params:, nonce:)) >= params[:d]
+      end
+
+      def self.leading_zero_bits(bytes)
+        count = 0
+        bytes.each_byte do |byte|
+          return count + 8 - byte.bit_length unless byte.zero?
+
+          count += 8
+        end
+        count
+      end
+    end
+  end
+end

data/requirements.txt

@@ -0,0 +1 @@
+argon2-cffi

data/solve.py

@@ -0,0 +1,88 @@
+#!/usr/bin/env python3
+"""
+Kiosk-shipped Argon2id proof-of-work solver.
+
+This script is invoked by an assistant when it receives a `pow_required`
+challenge from a Kiosk provider.  It finds the smallest nonce n ≥ 0 such that
+
+    Argon2id(password=str(n), salt=base64decode(challenge.salt),
+             m_cost=m, t_cost=t, parallelism=p, hash_len=32, version=19)
+
+has at least `d` leading zero bits, then prints {"nonce": "<n>"}.
+
+Usage:
+    python3 solve.py '<challenge json>'
+    python3 solve.py  # reads challenge JSON from stdin if no argument given
+
+Challenge JSON schema:
+    {
+      "salt":   "<base64-encoded raw salt, ≥ 8 bytes>",
+      "params": { "m": <KiB>, "t": <iters>, "p": <parallelism>, "d": <bits> }
+    }
+
+Dependencies:
+    pip install argon2-cffi
+
+The Ruby provider verifies with the same parameters (Argon2::Ext.argon2id_hash_raw
+via libargon2, version 0x13).  Both sides produce byte-identical digests —
+`bundle exec rake parity`, in the kiosk monorepo, runs that comparison by hand;
+the Rakefile it lives in is not packaged with this gem.
+"""
+
+import argon2.low_level
+import base64
+import json
+import sys
+
+
+def leading_zero_bits(data: bytes) -> int:
+    """Count leading zero bits from the MSB of byte 0, spanning bytes."""
+    count = 0
+    for b in data:
+        if b == 0:
+            count += 8
+        else:
+            count += 8 - b.bit_length()
+            break
+    return count
+
+
+def solve(challenge: dict) -> str:
+    """Return the decimal nonce string that satisfies the challenge."""
+    salt   = base64.b64decode(challenge["salt"])
+    params = challenge["params"]
+    m      = int(params["m"])
+    t      = int(params["t"])
+    p      = int(params["p"])
+    d      = int(params["d"])
+
+    nonce = 0
+    while True:
+        secret = str(nonce).encode("ascii")
+        digest = argon2.low_level.hash_secret_raw(
+            secret=secret,
+            salt=salt,
+            time_cost=t,
+            memory_cost=m,
+            parallelism=p,
+            hash_len=32,
+            type=argon2.low_level.Type.ID,
+            version=19,
+        )
+        if leading_zero_bits(digest) >= d:
+            return str(nonce)
+        nonce += 1
+
+
+def main():
+    if len(sys.argv) > 1:
+        challenge = json.loads(sys.argv[1])
+    else:
+        challenge = json.load(sys.stdin)
+
+    nonce = solve(challenge)
+    print(json.dumps({"nonce": nonce}))
+
+
+if __name__ == "__main__":
+    main()

metadata

@@ -0,0 +1,108 @@
+--- !ruby/object:Gem::Specification
+name: kiosk-pow-argon2id
+version: !ruby/object:Gem::Version
+  version: 0.5.20
+platform: ruby
+authors:
+- Phil Pirozhkov
+bindir: bin
+cert_chain: []
+date: 1980-01-02 00:00:00.000000000 Z
+dependencies:
+- !ruby/object:Gem::Dependency
+  name: argon2
+  requirement: !ruby/object:Gem::Requirement
+    requirements:
+    - - "~>"
+      - !ruby/object:Gem::Version
+        version: '2.3'
+  type: :runtime
+  prerelease: false
+  version_requirements: !ruby/object:Gem::Requirement
+    requirements:
+    - - "~>"
+      - !ruby/object:Gem::Version
+        version: '2.3'
+- !ruby/object:Gem::Dependency
+  name: ffi
+  requirement: !ruby/object:Gem::Requirement
+    requirements:
+    - - "~>"
+      - !ruby/object:Gem::Version
+        version: '1.0'
+  type: :runtime
+  prerelease: false
+  version_requirements: !ruby/object:Gem::Requirement
+    requirements:
+    - - "~>"
+      - !ruby/object:Gem::Version
+        version: '1.0'
+- !ruby/object:Gem::Dependency
+  name: kiosk-pow
+  requirement: !ruby/object:Gem::Requirement
+    requirements:
+    - - "~>"
+      - !ruby/object:Gem::Version
+        version: 0.5.0
+  type: :runtime
+  prerelease: false
+  version_requirements: !ruby/object:Gem::Requirement
+    requirements:
+    - - "~>"
+      - !ruby/object:Gem::Version
+        version: 0.5.0
+description: |
+  kiosk-pow-argon2id is the legacy proof-of-work backend for the Kiosk
+  framework: an Argon2id search-form proof of work. The shipped default is
+  Equihash (kiosk-pow-equihash). Argon2id stays a legacy backend because its
+  64 MiB verify is too expensive for a gateway.
+
+  Ships the operator-side Ruby verify (one Argon2id evaluation, no loop) and
+  a Python solver (solve.py, argon2-cffi). The Ruby verify and the Python
+  solver produce byte-identical Argon2id digests. The gem's `:parity` spec
+  examples check this, and so does the `rake parity` task. Neither the
+  Rakefile nor spec/ is in the package.
+
+  Built on kiosk-pow. kiosk-reputation reaches it when a host registers it
+  under "argon2id"; it does not register itself. Does not depend on
+  kiosk-core or Rails: pure Ruby and libargon2 through FFI.
+email:
+- hello@fili.pp.ru
+executables: []
+extensions: []
+extra_rdoc_files: []
+files:
+- CHANGELOG.md
+- LICENSE.txt
+- README.md
+- lib/kiosk/pow/argon2id.rb
+- lib/kiosk/pow/argon2id/version.rb
+- requirements.txt
+- solve.py
+homepage: https://kiosk.tech
+licenses:
+- Apache-2.0
+metadata:
+  homepage_uri: https://kiosk.tech
+  source_code_uri: https://github.com/kiosk-hq/kiosk
+  changelog_uri: https://github.com/kiosk-hq/kiosk/blob/main/kiosk-pow-argon2id/CHANGELOG.md
+  bug_tracker_uri: https://github.com/kiosk-hq/kiosk/issues
+  rubygems_mfa_required: 'true'
+rdoc_options: []
+require_paths:
+- lib
+required_ruby_version: !ruby/object:Gem::Requirement
+  requirements:
+  - - ">="
+    - !ruby/object:Gem::Version
+      version: '4.0'
+required_rubygems_version: !ruby/object:Gem::Requirement
+  requirements:
+  - - ">="
+    - !ruby/object:Gem::Version
+      version: '0'
+requirements: []
+rubygems_version: 4.0.3
+specification_version: 4
+summary: Argon2id memory-hard proof-of-work backend for Kiosk (legacy)
+test_files: []