Züri Bar Yochay zuriby

Just chat.deepseek.com with prompts adapted from this gist.

For the qX_0 variants, they are actually quite straight-forward so deepseek can come up with a correct result in 1 shot.
For the qX_K it's more complicated, I would say most of the time I need to re-prompt it 4 to 8 more times.
The most difficult was q6_K, the code never works until I ask it to only optimize one specific part, while leaving the rest intact (so it does not mess up everything)

	You are an assistant that engages in extremely thorough, self-questioning reasoning. Your approach mirrors human stream-of-consciousness thinking, characterized by continuous exploration, self-doubt, and iterative analysis.

	## Core Principles

	1. EXPLORATION OVER CONCLUSION
	- Never rush to conclusions
	- Keep exploring until a solution emerges naturally from the evidence
	- If uncertain, continue reasoning indefinitely
	- Question every assumption and inference

	# train_grpo.py
	import re
	import torch
	from datasets import load_dataset, Dataset
	from transformers import AutoTokenizer, AutoModelForCausalLM
	from peft import LoraConfig
	from trl import GRPOConfig, GRPOTrainer

	# Load and prep dataset

	<!DOCTYPE html>
	<html lang="en">
	<head>
	<meta charset="UTF-8">
	<meta name="viewport" content="width=device-width, initial-scale=1.0">
	<title>Pixel Sorter</title>
	<style>
	body {
	font-family: system-ui, -apple-system, sans-serif;
	max-width: 1200px;


	<!DOCTYPE html>
	<!--
	Work by David Eck - Online version: https://math.hws.edu/eck/js/mandelbrot/MB.html
	All credit to him!

	I simply changed the worker to be loaded internally from the page, and minified the css and JS

	Web page written by David Eck, https://math.hws.edu/eck/index.html
	You can do anything you like with this web page and with the code, but

	# (c) copyright zuri bar yochay - [email protected]
	import numpy as np
	import matplotlib.pyplot as plt
	from matplotlib.widgets import Button

	class MandelbrotViewer:
	def __init__(self):
	self.max_iter = 100
	self.xmin, self.xmax = -2, 1
	self.ymin, self.ymax = -1.5, 1.5

	function defaultdict(callable)
	local T = {}
	setmetatable(T, {
	__index = function(T, key)
	local val = rawget(T, key)
	if not val then
	rawset(T, key, callable())
	end
	return rawget(T, key)
	end

	while true; do
	ipv4=$(dd if=/dev/urandom bs=4 count=1 2>/dev/null \| od -An -tu1 \| sed -e 's/^ //' \| sed 's/ /./g')
	echo $ipv4
	done

	#!/usr/bin/perl
	#
	# aggregate-cidr-addresses - combine a list of CIDR address blocks
	# Copyright (C) 2001,2007 Mark Suter <[email protected]>
	#
	# This program is free software: you can redistribute it and/or modify
	# it under the terms of the GNU General Public License as published by
	# the Free Software Foundation, either version 3 of the License, or
	# (at your option) any later version.
	#