Skip to content

Instantly share code, notes, and snippets.

View computer-whisperer's full-sized avatar

Christian Balcom computer-whisperer

View GitHub Profile
"<context>
Chapter 1
<summary>
<pad>
Valancy wakes up in the middle of the night and realizes that she is now twenty-ninth years old and unwed.
This is a stinging realization for Valancy, who has always hoped to find a man to love her. She begins to cry.
She is afraid that crying will make her heart pain worse and that her mother will ask her why she is crying.
Valancy laughs at her mother, for she knows that she has a good sense of humor.
She knows that her room is ugly,
but she does not attempt to change it. She lives in her imaginary castle, the Blue Castle, where she has had many
<context>
Chapter 1
<summary>
<pad> Valancy wakes up in the middle of the night and realizes that she is now twenty-ninth years old and unwed.
This is a stinging realization for Valancy, who has always hoped to find a man to love her. She begins to cry.
She is afraid that crying will make her heart pain worse and that her mother will ask her why she is crying.
Valancy laughs at her mother, for she knows that she has a good sense of humor.
She knows that her room is ugly, but she does not attempt to change it. She lives in her imaginary castle, the
Blue Castle, where she has had many lovers. She has never gotten old enough to be married, though, recently, her hero
<context>
Chapter 2
<summary>
<pad> Valancy wakes up in the middle of the night and looks in the mirror. She doesn't like what she sees. She decides that she isn't pretty and that she's ugly. She's been like this all her life. Valancy gets dressed and puts her hair in an updoll. She looks at her reflection in the dingy mirror and curses her appearance. She can't get rid of the fear that she will die alone and unloved. She thinks about how she'll never be the fairy in the fairy-tale that she has always wanted to be.</s>
<body>
Then, they went to Dr. Ambrose Marsh of Port Lawrence, who had married
Second Cousin Adelaide Stirling.
@computer-whisperer
computer-whisperer / fire_apple_workflow.txt
Last active March 6, 2023 23:14
Fire apple stable diffusion workflow
This uses the Deliberate V2 model, with the standard depth ControlNet model, and a tweaked movie2movie script that sets the img2img input prompt of each frame to the output of the last frame.
here is the script I used: https://gist.github.com/computer-whisperer/8d7587a0958ec477b8f4ffe056187885
here are the full settings:
model: deliberate_v2
Image: a black frame 480x360
Prompt: (flames: 0.4), blue flames on a black background, (black background: 2), (photorealistic:1.4), (dark: 2), (dynamic: 0.6), <lora:epiNoiseoffset_v2:1>, fog, smoke art, (flames: 0.4), hires, wisps of smoke, soft
negative prompt: (digital art: 2), (graffiti: 2), (sharp: 2), nude, people, boy, (face: 2), building, volcano, object, painting, lamp, smokestack, cooker, appliance, border, sketches, lowres, normal quality, explosions, tree, balls, colorful, pink, (airbrushed: 2), (bright: 2), hole, saturated
@computer-whisperer
computer-whisperer / movie2movie_custom
Created March 6, 2023 22:17
Control net movie to movie script w/ prompt image chaining
import copy
import os
import shutil
import cv2
import gradio as gr
import modules.scripts as scripts
from modules import images
from modules.processing import process_images
import random
class WeightDistribution:
def __init__(self, min_val, max_val, num_buckets):
self.max_val = max_val
self.min_val = min_val
self.num_buckets = num_buckets
self.bucket_len = (max_val-min_val)/num_buckets
//
// Created by christian on 8/18/21.
//
#include <string.h>
#include "stm_esp_proto.h"
#include "crc32.h"
/*
* Serialized root format (all 1-byte packed):
*
#include <time.h>
double getTime(void)
{
struct timespec tv;
if(clock_gettime(CLOCK_REALTIME, &tv) != 0) return 0;
return (tv.tv_sec + (tv.tv_nsec / 1000000000.0));
}
[root@c-srv3 chiatemp]# ./bladebit -i 022fb42c08c12de3a6af053880199806532e79515f94e83461612101f9412f9e
Warning: No output folder specified. Using current directory.
Creating 1 plots:
Output path :
Thread count : 96
Warm start enabled : false
System Memory: 194/377 GiB.
Memory required: 416 GiB.
Warning: Not enough memory available. Buffer allocation may fail.
About generating k32s on GPUs:
At a high level, plotting involves alternating steps of calculating a bunch of values (parallel!) and sorting them
(parallel? but harder). The problem is that you have to finish every single value calculation for table i (and sort
them somehow) before you can start table i+1. This means you have to put all that data somewhere, and then read it all
back in again. Here is a rough idea how much data needs to get stored:
table1 table2 table3 table4 table5 table6 table7
^ ^ ^ ^ ^ ^ ^
| | | | | | |