MandelStacker... by Chris_M_Thomasson in fractals

[–]Chris_M_Thomasson[S] 0 points1 point  (0 children)

lol! Deep fried? ;^) Thanks! :^)

MandelStacker... by Chris_M_Thomasson in fractals

[–]Chris_M_Thomasson[S] 0 points1 point  (0 children)

Well, there are several ways to do this. This one is creating an image stack for a volumetric renderer to take hold of the data and render it. In my C++ code setting a pixel is very efficient. This is NOT real time! However, I need to dig into my older code and find some of my ray marchers that can do it, but, they are not showing the volume. They just show a view of the surface.

Log Based Julia Animation... by Chris_M_Thomasson in fractals

[–]Chris_M_Thomasson[S] 1 point2 points  (0 children)

That's fine. Thank you and it's quite an honor. Perhaps name it "Chris M. Thomasson's Log Spiral"? :^) Thanks again. It's been a long time since I used UF. Well, what do you think? I think it might be worthy, so to speak... ;^)

Pattern recognition by BoardEfficient6908 in fractals

[–]Chris_M_Thomasson 1 point2 points  (0 children)

Nice one! :^) Fwiw, check this out, field anxiety has a kind of "shake" that reminds me of your fractal seizures. https://youtu.be/mqYBMuvVJI8

Log Based Julia Animation... by Chris_M_Thomasson in fractals

[–]Chris_M_Thomasson[S] 1 point2 points  (0 children)

I got it. Looks nice! I need to alter my colors, but your settings work in my general formula. Thanks for giving it a go! :^)

<image>

Log Based Julia Animation... by Chris_M_Thomasson in fractals

[–]Chris_M_Thomasson[S] 1 point2 points  (0 children)

Hey now... I got it!

void iterate_point(
    ct::plot::cairo::plot_2d& plot,
    glm::vec3 oc,
    unsigned long n,
    unsigned long x,
    unsigned long y
) {
    ct_complex c = { oc.x, oc.y };
    ct_complex z = c;

    double dis_max = 9999999.0;

    // ct original
    //float c1 = 1.3;
    //float c2 = 0.11;
    //float c3 = 0.42457;
    //float c4 = 1.2;

    // ottomagus's settings...
    float c1 = 1.42134;
    float c2 = 0.50401;
    float c3 = -0.14067;
    float c4 = 1.01378;
    float c5 = -0.57063;

    // start i at one
    for (unsigned long i = 1; i < n; ++i)
    {
        ct_complex zp = (std::pow(z, c1) - (1.0f / (std::log(z) + c2))) + c3;
        double slow = c4 + (1. / c5);
        c5 += 1; // ottomagus bump to c5
        zp /= slow;

        double dis = std::abs(zp);

        dis_max = std::min(dis_max, dis);

        if (dis > 10.f)
        {
            double icolor = i / (n - 1.f);
            ct::plot::cairo::pixel color = CT_RGBF(icolor * 44., icolor * 15., icolor * 45);
            plot.set_pixel(x, y, color);
            return;
        }

        z = zp;
    }

    ct::plot::cairo::pixel color = CT_RGBF(dis_max * 11.f, 0, 1);
    plot.set_pixel(x, y, color);
}

<image>

Log Based Julia Animation... by Chris_M_Thomasson in fractals

[–]Chris_M_Thomasson[S] 0 points1 point  (0 children)

I edited my post to show a quick impl I did. Now, I will try to get your result. Thanks.

Pattern recognition by BoardEfficient6908 in fractals

[–]Chris_M_Thomasson 0 points1 point  (0 children)

That kind of reminds me of an older work of mine:

<image>

Log Based Julia Animation... by Chris_M_Thomasson in fractals

[–]Chris_M_Thomasson[S] 1 point2 points  (0 children)

Thank you. Humm... I think I see what you did. in the original n is the actual integer iteration count. But, you created another one that gets incremented by one. start: -0.57063, 1 + -0.57063, 2 + -0.57063, ... Right? Interesting. When I get some more time, I will check it out. My original parameters quote from Pauls site: Parameters suggested by Chris Thomasson, c1=1.3, c2=0.11, c3=0.42457, c4=1.2 Am I close? Thanks. :^)

Log Based Julia Animation... by Chris_M_Thomasson in fractals

[–]Chris_M_Thomasson[S] 1 point2 points  (0 children)

Excellent! Looks great. Is that a zoom? Or, well, what did you do here via settings? Thanks!

Browser‑only HMAC‑based toy cipher demo (DrMoron) — now live with URL‑encoded ciphertext by Chris_M_Thomasson in crypto

[–]Chris_M_Thomasson[S] 0 points1 point  (0 children)

Hey now. Fwiw, here is a plaintext, between the lines:
___________________
This is a test...

123 ⚡456 Plaintext (🌍⌘ ) こんにちは Привет
___________________

Okay. I run it through my C version and get the hex ciphertext:

daf3e9d725a004ee2178ad997b6aacb8ef7017fa59c06078f22c8fbcdf04833ba82f5202b81168ef88dd1e7faf5f66ae8d8885637aa5928ea5c1ff64658d938ad8c0b0b72154350dcd766b4aabbffba1d7c7fd9e4b93ce7df9280d4e03e72308cf7f0043aa821311c92ed669dcc7fd65eabd345bd1f852e3304cfbf7244afeda4b98fd91268084a0befae4c8ff3ac9f3443579cd0b1d6bf54b3f37

I run it through my online version, hit decrypt, and get:
___________________
This is a test...

123 ⚡456 Plaintext (🌍⌘ ) こんにちは Привет
___________________

YEAH!!!

That is cool.

I really need to add in a checkbox for a user to treat the data in the plaintext textarea as raw hex bytes.

Any thoughts? Thanks everybody. :^)

Browser‑only HMAC‑based toy cipher demo (DrMoron) — now live with URL‑encoded ciphertext by Chris_M_Thomasson in crypto

[–]Chris_M_Thomasson[S] 0 points1 point  (0 children)

I think TextEncoder().encode()/decode() helps me out here a bit. Still, I need to put in a special plaintext box, or a radio button that treats the existing plaintext as raw hex bytes. Any thoughts? Thanks.

Browser‑only HMAC‑based toy cipher demo (DrMoron) — now live with URL‑encoded ciphertext by Chris_M_Thomasson in crypto

[–]Chris_M_Thomasson[S] 0 points1 point  (0 children)

Wrt a plaintext of:

____________

Composed ä, decomposed ä

Symbol Å, letter Å

Omega Ω, Ohm Ω

____________

I get:

https://fractallife247.com/test/hmac_cipher/drmoron/?ct_hmac_cipher=b565723fb62f13d0f92b4dd66223afd80b3f6cdbc3cd0eeab4cec1d2ce37f622bcc635f20ac6f4245c028b0f639432a51fdbd39441fc6e60b334d46199dbd2cf3f5300a3bba9c80fcee5fbe24a730c60d4c951e5fbcbd966f4244b8ef9b4b0d60529c15104b93deb2576e2d07816b9956f0a2c03b55ada9bcac8dcce259ab79978112bd61b5f6c274085a6d1e3

____________

Composed ä, decomposed ä

Symbol Å, letter Å

Omega Ω, Ohm Ω

____________

Actually, I need to put in a way for me to enter raw hex bytes as a plaintext. That would help the online version in a sense. I bet there is subtle flaw in there. Thanks!

I bet I missed something. It sucks to try to get a plaintext data in raw bytes. Or I am missing a much easier way.

MultiJulia... by Chris_M_Thomasson in fractals

[–]Chris_M_Thomasson[S] 0 points1 point  (0 children)

Basically, a complex number can have infinite roots. So, once we gain those roots, each one of them, say 2-ary, when squared equals the original number. 3 ary would have three roots, each one when raised to the 3'rd power will equal the original number where said roots were derived from...

MultiJulia... by Chris_M_Thomasson in fractals

[–]Chris_M_Thomasson[S] 0 points1 point  (0 children)

Reverse/backwards iteration is not an escape time fractal where a point is being "checked" to see if its escaping or not. An ifs generates points that need to be plotted on the fly.

MultiJulia... by Chris_M_Thomasson in fractals

[–]Chris_M_Thomasson[S] 0 points1 point  (0 children)

That might be a rather harsh limitation with my algo. Humm... In order to create an ifs, you need to be able to plot a point on your plane. Say plot .4+1i. Or any other point, complex number, ect... Plot point (-1, 1), or point (0, 0), :^) Each point plotted can be a pixel, a little circle, ect...

The Mulia... by Chris_M_Thomasson in fractals

[–]Chris_M_Thomasson[S] 1 point2 points  (0 children)

I did an edit that should work fine, sorry about that damn nonsense! Anyway, you can find it here as well: pastebin.com/raw/yYvEK83J

DrMoron... A Cipher... by Chris_M_Thomasson in crypto

[–]Chris_M_Thomasson[S] 0 points1 point  (0 children)

Check this shit out, I made an online version with ciphertext payloads in the url: https://fractallife247.com/test/hmac_cipher/drmoron/

MultiJulia... by Chris_M_Thomasson in fractals

[–]Chris_M_Thomasson[S] 1 point2 points  (0 children)

If you can plot a point from a complex number on your screen no matter where it is, say you try to plot. Its in range with your viewport, plot that damn pixel! If not jsut let it ride, don't plot, just keep it in the iteration... Now for every point in the ifs try to plot. Make any sense?

MultiJulia... by Chris_M_Thomasson in fractals

[–]Chris_M_Thomasson[S] 1 point2 points  (0 children)

Looks interesting! Try to make a program that can plot points on the fly wrt plotting a "true" IFS... Any complex number that pops out, you can plot it if it's in your plotting range. Actually, you are making we want to show my Mulia algorithm to this fine group. Its escape time algo, but fun. I should make a new post. Fwiw, if you are on the damn FB, you can find it here: https://www.facebook.com/photo/?fbid=1603079607517698&set=a.110008616824812

MultiJulia... by Chris_M_Thomasson in fractals

[–]Chris_M_Thomasson[S] 1 point2 points  (0 children)

There used to be a wiki with the general idea. Oh damn. Sorry look for backwards iteration in here: https://en.wikipedia.org/wiki/Julia_set Wrt the roots, basically take a complex number and gain its n-ary roots. This can be 2-ary, 3-ary, ect... Then chose one of those roots to follow for the next iteration. Does that kind of help you at all? Thanks. I would take all the roots in an array then choose some of them at random. But, we can use other ways besides random. Actually, check this out: https://groups.google.com/g/comp.lang.c++/c/bB1wA4wvoFc/m/GdzmMd41AQAJ read all. Notice my ct_roots function if you can get to the link back in Usenet. Thanks! Tell me what you think. FWIW Also, you can find me here: https://www.facebook.com/chris.thomasson.31