Aaron Toponce atoponce

So you think ChatGPT solved K4? You're not the only one. First, here's the K4 ciphertext and clues:

                           OBKR
UOXOGHULBSOLIFBBWFLRVQQPRNGKSSO
TWTQSJQSSEKZZWATJKLUDIAWINFBNYP
VTTMZFPKWGDKZXTJCDIGKUHUAUEKCAR

Jim Sandborn, the creator of the sculpture and puzzle has given us clues, revealing that characters:

10,000 seconds RE:

Zone	HR	RE	Ratio
1	80	15	0.0015
1	85	17	0.0017
1	90	19	0.0019
1	95	22	0.0022
1	100	24	0.0024
1	105	26	0.0026

December 1974
- Asmussen, Erling, and Flemming Bonde-Petersen
- "Apparent Efficiency and Storage of Elastic Energy in Human Muscles during Exercise"
- https://doi.org/10.1111/j.1748-1716.1974.tb05776.x
June 1, 1977
- Cavagna, G. A., and M. Kaneko
- “Mechanical work and efficiency in level walking and running.”
- https://doi.org/10.1113/jphysiol.1977.sp011866
November 1, 1982
Williams, Keith R., and Peter R. Cavanagh

test_name	OptiHash	SHA-256	urandom
diehard_birthdays	🟥	🟢	🟢
diehard_operm5	🟥	🟥	🟥
diehard_rank_32x32	🟥	🟥	🟥
diehard_rank_6x8	🟥	🟥	🟥
diehard_bitstream	🟥	🟥	🟥
diehard_opso	🟥	🟥	🟥
diehard_oqso	🟥	🟥	🟥
diehard_dna	🟥	🟢	🟥

	"use strict"

	/** Class representing the Trivium stream cipher. */
	module.exports = class Trivium {
	#state // Trivium 288-bit state.
	#keystream // Trivium keystream.

	/**
	* Initialize Trivium with key and IV.
	* @param {Uint8Array} key - An 8-bit array of 10 unsigned integers.

	#!/usr/bin/env node

	/**
	* Forked from https://gist.github.com/PaulCapestany/6148566. Changes:
	* - Beautified code
	* - NodeJS-specific (will not work in the browser)
	* - Scope variables with let and const keywords
	* - 256-bit RNG
	* - Remove von Neumann debiasing
	* - Remove byte assembly

	First column is HR, second column is RE for 10,000 seconds at that HR.
	Header is formula from the lowest HR to the max HR in that segment wihout the intermediate points.
	There are 7 separate jumps.

	8x/15-83/3
	==========
	80: 15
	85: 17
	90: 19
	95: 22

	0000: 96a296d224f285c67bee93c30f8a309157f0daa35dc5b87e410b78630a09cfc7
	0001: b413f47d13ee2fe6c845b2ee141af81de858df4ec549a58b7970bb96645bc8d2
	0002: fcf0a6c700dd13e274b6fba8deea8dd9b26e4eedde3495717cac8408c9c5177f
	0003: 583c7dfb7b3055d99465544032a571e10a134b1b6f769422bbb71fd7fa167a5d
	0004: 4f35212d12f9ad2036492c95f1fe79baf4ec7bd9bef3dffa7579f2293ff546a4
	0005: 9f1afa4dc124cba73134e82ff50f17c8f7164257c79fed9a13f5943a6acb8e3d
	0006: 40d88127d4d31a3891f41598eeed41174e5bc89b1eb9bbd66a8cbfc09956a3fd
	0007: 2ecd8a6b7d2845546659ad4cf443533cf921b19dc81fa83934e83821b4dfdcb7
	0008: b4c43b50bf245bd727623e3c775a8fcfb8d823d00b57dd65f7f79dd33f126315
	0009: c87479cd656e7e3ad6bd8db402e8027df454b2b0c42ff29e093458beb98a23d4

	#!/bin/bash

	i=0

	until [[ $i -eq 65536 ]]; do
	printf "%04x: " "${i}"
	printf "%04x" "${i}" \| xxd -r -p \| /tmp/c-optihash/c-optihash /dev/stdin
	printf "\n"
	((i=i+1))
	done > /tmp/optihash-hashes.txt