Thursday, March 10, 2022

SiMD Render - Vector Graphics, Boxes, Ellipses, Curves & Fonts

VESA Standards : Vector Graphics, Boxes, Ellipses, Curves & Fonts : Consolas & other brilliant fonts : (c)RS

SiMD Render - Vector Graphics, Boxes, Ellipses, Curves & Fonts

Improve Console & TV & BIOS & General Animated Render

Vector Display Standards with low relative CPU Weight
SiMD Polygon Font Method Render

Default option point scaling (the space) : Metadata Vector Fonts with Curl mathematical vector :

16 Bit : SiMD 1 width
32 Bit : SiMD Double Width

High precision for AVX 32Bit to 256Bit width precision.

Vectoring with SiMD allows traditional CPU mastered VESA Emulation desktops & safe mode to be super fast & displays to conform to VESA render standards with little effort & a 1MB Table ROM.

https://science.n-helix.com/2022/04/vecsr.html



https://science.n-helix.com/2022/03/fsr-focal-length.html

https://science.n-helix.com/2018/01/integer-floats-with-remainder-theory.html

*

*Application of SiMD Polygon Font Method Render

*3D Render method with Console input DEMO : RS

3D Display access to correct display of fonts at angles in games & apps without Utilizing 3rd Axis maths on a simple Shape polygon Vector font or shape. (c)Rupert S

3rd dimensional access with vector fonts by a simple method:

Render text to virtual screen layer AKA a fully rendered monochrome, 2 colour or multi colour..

Bitmap/Texture,

Due to latency we have 3 frames ahead to render to bitmap DPT 3 / Dot 5

Can be higher resolution & we can sub sample with closer view priority...

We then rotate the texture on our output polygon & factor size differential.

The maths is simple enough to implement in games on an SSE configured Celeron D (depending on resolution and Bilinear filter & resize

Why ? Because rotating a polygon is harder than subtracting or adding width, Hight & direction to fully complex polygon Fonts & Polygon lines or curves...

The maths is simple enough to implement in games on an SSE configured Celeron D (depending on resolution and Bilinear filter & resize.
Posted by at No comments:

Saturday, March 5, 2022

FSR-Focal Length

Fast FSR-Focal Length Ray-Tracing Code: Refraction & index Sharpening, Blurring & Image resizing:RS

FSR Focal Length Box Image Scaling Sharpening & blurring &or expansion with mathematical sharpening interpolation (c)Rupert S

*

Some photos of L2, Close to L2 may be an impossible focus; Unless image enhancement is used
(Sharpening & light angle mathematical focal length shift
(Computational Focal Length Sharpening Enhanced by Ray-Tracing)

*

We need to utilize diffraction & ray dispersion mathematics from physics,
For example for opaque surfaces & water ripples; Or by our personal preference lenses

For digital image focusing, Sharpening, Clarity & Depth Of Field DOF,
& When processing photos, video & art.

For this we present: Fast FSR-Focal Length;
With the intention of Sharply defined focus & processing.

*

Fast FSR-Focal Length Ray-Tracing Code: Refraction & index Sharpening, Blurring & Image resizing:RS

& FSR Focal Length Box Image Scaling Sharpening & blurring &or expansion with mathematical sharpening interpolation (c)Rupert S

3d Graphics, Frame Render & Texture Image enhancement:

(Sharpening & light angle mathematical focal length shift
(Computational Focal Length Sharpening Enhanced by Ray-Tracing)

Focal length works by expanding an image by the refraction index,
In Figure 1 a simple example is offered:

fig 1 (I)=Light Ray Path (===)=lens


(object or image)
I I
I I
       I  =============== I
\ /
      =======================
==I===I===I===I==I==
       =====================
/ I / I \ /  I \ I \


https://bit.ly/VESA_BT


https://science.n-helix.com/2022/03/fsr-focal-length.html
https://science.n-helix.com/2021/09/temporal-aliasing-image-shaping-polygon.html
https://science.n-helix.com/2022/03/simd-render.html
https://science.n-helix.com/2019/06/vulkan-stack.html

https://github.com/GPUOpen-Effects/FidelityFX-FSR2/releases/tag/v2.0.1a
https://github.com/GPUOpen-Effects/FidelityFX-FSR/releases/tag/v1.0.2

Ray-Tracing Code: Refraction & index Sharpening, Blurring & Image resizing:RS

We utilize refraction, Expansion & Compression math code to work out the Image formed on the other side..

With Refraction & Reflection Simplex Raytracing models (15 to 400 Rays normally)..

We are able to sharpen or blur a scene by depth or by focus or by density or optical capacities of materials & matter or curvature for water surfaces..

To simplify matters for computational performance we work out the multiplication or division factors involved in compressing or expanding the image or audio compared to the perspective of the perceiver, Viewer or camera, Ear or Eye or infact sensation.

FSR & FSR-FL (Camera lens & CMOS Sharpening & Focus adjustment)

Methods To clarify (Hardware)

OpenCL (Microsoft CL pack is available to DX12 V11 Devices to OPenCL 1.2 + Khronos)

SiMD, AVX-256, AVX-512(bit) FPU(183Bit + 256 on Epyc Zen3)
Precision Double, Precision Single Float

Ray-Tracing SiMD (Such as PS5 & XBox & RX5770 :2019+)

PhysicsX (NVidia & CPU)

Also works for Thrust & Curvature motion & momentum.

Rupert S

(c)Rupert S https://science.n-helix.com

*

FSR-FL Magnifex3D(tm)RS

3d image Phase differentiation through differential : Magnifex3D(tm)RS

The objective of this phase is to create 2 objectives:

3D positioning & shape
Focus the image or sound impression

FSR-FL Calculations of diffraction do 2 things:

Focus the image around 0.00+-3
Calculate Distance & 3D Parameters though Differential Diffraction

The same can be stated of audio & the parameters are the same in effect.

3d image Phase differentiation through differential : Magnifex3D(tm) (c) Rupert S https://science.n-helix.com

3d image including distance : WEBB : During the watching of this video

James Webb Telescope shares first focused Image of star HD 84406
https://www.youtube.com/watch?v=-wo_AT8pR6o

It came to my attention that 18 segments obviously produce location specific data,
Additional calculations would be required to calculate distance though ARC

List

18 Diverse ANGLES

1 View

18 impressions of star HD 84406

Phase decouple a single frame per 17 produces a 3D image with distance...

Calculating the 18 mirror Angle differentials with slightly different data will create a 3D view,

For example of a chemical; A multiple angle refraction image results in a 3D image.

Common Usage : 3D

Magnifiers, Telescopes, Microscopes, Atomic Wave Analysis.

*

Research topic RS : https://is.gd/Dot5CodecGPU https://is.gd/CodecDolby https://is.gd/CodecHDR_WCG https://is.gd/HPDigitalWavelet https://is.gd/DisplaySourceCode

*
Sharp Blur Depth Perception : (c)RS

FSR FL Sharp Blur Depth Perception : (c)RS 3D From 2D for eyes


For the re-creation of 3D Geometry from a single focus viewer point & abstracting of 3D & 4D viewpoints on more viewpoints & inferencing of camera shake in 3D Geometry realisation.

Focus a lens & the sharpest bit is in focus; Indeed we can improve focus by searching mathematically for sharpness..
Once we understand how this works.

A lens group set to focus at 1 Meter (50mm Lens example) has a sharp content in the 1m range..
Things that are closer are blurred a little; But the blur is a wavelet examination away from 3D!

We know that subjects in focus have an ideal perfect sharpness.
When we know the lens used we may prove focus depth; We can then prove how close or far away objects are in the photo! How ?

Sharpness & blur examination.

A human eye has an average Sharp range of around 6cm of depth variance; So we can judge depth by observing if the object is in the foreground (Side to side scan: Habitual)..

Mathematically provable sharpness in range of the focusing point if ISO, Focal Width & focus length are known,

We can therefore assess how close things are by focusing to know distances & depths,
The further away the subject content is the slower sharpness is lost over distance.

Close focusing brings the angle closer to the triangle & therefore objects further away are quickly blurry if further away.

Long focus is a === linear view & focus sharpness varies slightly over distance.

*
https://is.gd/LEDSource

Utility of FSR-FL-RT
Minimal Process Compute
Fast FSR-Focal Length Ray-Tracing Code

Portable OpenCL
OpenCL may be ideal for TV & Device, Display & Audio rendering & Upscaling with integral POCCL Support

https://is.gd/DisplaySourceCode

https://aka.ms/clglcp-faq
http://portablecl.org/
https://github.com/pocl/pocl

https://apps.microsoft.com/store/detail/9NQPSL29BFFF?hl=en-us&gl=US

http://portablecl.org/downloads/pocl-3.0.tar.gz

Fast FSR-Focal Length Ray-Tracing for 3D realisation (c)Rupert S


Fast FSR-Focal Length Ray-Tracing with dynamic contrast emulation
Fast FSR-Focal Length Ray-Tracing with dynamic contrast 3D Shaped LED emulation
Fast FSR-Focal Length Ray-Tracing with dynamic contrast emulation & 3D Directional DOT Bead for micro deformation pixel 3D Holography

Fast FSR-Focal Length Ray-Tracing for 3D realisation though depth emulation & light angle (LED Glass) replication; Such as side by side shaping of the LED,
So that eyes are different due to angle require processing

Fast FSR-Focal Length Ray-Tracing with dynamic contrast 3D Shaped LED emulation

Side by Side LED, Left & Right & Up and Down matrix around a tiny refraction curvature..
Create a 3D Image
|_[_]_|
|_[_]_| Lenses on top
|_[_]_|

Fast FSR-Focal Length Ray-Tracing with dynamic contrast emulation & 3D Directional DOT Bead for micro deformation pixel 3D Holography

3D micro bump with a higher index wide angle, the light comes from multiple LED Colours & can be mathematically shaped to curve the LED 6/9/12 pattern into a blend that a single pixel looks of all colours.

(_O_)
(_O_) Lenses on top
(_O_)

4 primary colour composure: RS


What does decomposing a frame into 4 colour groups mean?
Red, Green, Blue, Grayscale
Each pixel on a screen has 4 colour components & they are on a different place on the screen,
So when we sharpen; We sharpen to the closest pixel LED of the right colour,
Obtaining the best colour with the most logical of LED content,
the right colour sharpened for the right LED

*****

FSR_FL RT: Proven

ML Training Telescope, Camera, Video & Image Display Enhancement, Produced 2 Hours ago! 2022-12-02 https://www.science.org/doi/pdf/10.1126/sciadv.add3433?download=true

https://is.gd/MLCodecShaping

https://science.n-helix.com/2022/03/fsr-focal-length.html
https://science.n-helix.com/2021/09/temporal-aliasing-image-shaping-polygon.html
https://science.n-helix.com/2022/02/visual-acuity-of-eye-replacements.html
https://science.n-helix.com/2019/06/vulkan-stack.html

https://science.n-helix.com/2022/03/simd-render.html

https://science.n-helix.com/2022/09/ovccans.html
https://science.n-helix.com/2022/11/frame-expand-gen-3.html
https://science.n-helix.com/2022/10/ml.html

https://science.n-helix.com/2022/08/jit-dongle.html
https://science.n-helix.com/2022/06/jit-compiler.html
Posted by at No comments:

Friday, February 18, 2022

Interrupt Entropy

NT Interrupt counter Entropy : A counter theory : RS


"more importantly, our
distribution is not 2-monotone like NT's, because in addition to the
cycle counter, we also include in those 4 words a register value, a
return address, and an inverted jiffies. (Whether capturing anything
beyond the cycle counter in the interrupt handler is even adding much of
value is a question for a different time.)"

NT Interrupt counter Entropy : A counter theory : RS

To be clear interrupts are old fashioned (NT & Bios) : Points

Network cards have offloading? Yes & why cannot we?

Offloaded does not mean that a time differential matrix HASH AES of 32Bit words,
Cross pollinated though MMX, AVX , SiMD is plausible!

Combined with even network latency timing & interrupt latency...

Various system differentials can alternate line in our table per clock sync!

In this reference Quartz clock instability is not only counter acted by NTP...
But also utilized as a variable co-modifier.

So why not also advantage ourselves of the clock frequency scaling effect to confuse odds again for Entropy (Random, Not Entropy)

SSD does also have a write counter & a cleared state, not so boring as one thinks if per 32KB segment is hashed in 4Bit, 8,Bit 32Bit float! (remember we have DOT3 DOT 4 & INT8 in ML)

We can utilize write cycle statistics & all hardware; Interrupts by themselves are rather Boring!

Computed timings on processes multiplexed over 3 Threads per group in competition is also a potential complexifier of Random

Rupert S

*
Very usable /dev/rnd Random Ring : TRNG : GPU : CPU : Asics : Using Chaos Wavelet
(Usable as encryption archetype): Chaos:A:B:T:Pi:Arc:Sin:Tan
https://science.n-helix.com/2023/02/smart-compression.html
*

Pollinate nodes : https://pollinate.n-helix.com/ https://pollinate2.n-helix.com/

https://science.n-helix.com/2018/12/rng.html

https://science.n-helix.com/2022/02/rdseed.html

https://science.n-helix.com/2017/04/rng-and-random-web.html

https://science.n-helix.com/2022/02/interrupt-entropy.html

https://science.n-helix.com/2018/05/matrix-of-density.html

https://science.n-helix.com/2019/10/classic-physics.html

https://science.n-helix.com/2021/11/monticarlo-workload-selector.html

https://science.n-helix.com/2022/03/security-aspect-leaf-hash-identifiers.html

https://science.n-helix.com/2022/02/visual-acuity-of-eye-replacements.html

****

PreSEED Poly Elliptic SiMD RAND : RS


Preseed ; 3 Seeds with AES or Poly ChaCha or even 1 : 2 would be rather fast Init

Blending them would make a rather paranoid Kernel developer feel safe! :D

Like so List:

3 seeds 32Bit or 64Bit :
Examples :

1 Seed : Pre seeded from CPU IRQ & Net 16Bit values each & merged
2 & 3 from server https://pollinate.n-helix.com &or System TRNG

4 Seed mix 128Bit Value

Advantages :

AVX & SiMD Mixxer is fast 'Byte Swap & Maths etcetera" & MultiThreaded
AES Support is common :

*

HASH : RSA Source Cert C/TRNG : (c)RS


Elliptic RSA : Cert Mixer : RSA 4096/2048/1024Temporal : 384/256/192 ECC Temporal

Centric Entropy HASH: Butterfly Effects

ChaCha
SM4
SHA2
SHA3

Elliptic Encipher
AES
Poly ChaCha

Elliptic : Time Variance : Tick Count Variance : On & Off Variance : IRQ

*

Time & Crystal : Quartz as a diffraction point fractal differentiator : RS


RDTSC Variable bit differentiation & deviation of the quartz sub .0001 Value combined with complexity of unique interplay with Alternative clocks such as Network cards, Audio cards & USB Sticks & Bluetooth radio clocks & Ultimately the NTP Pools themselves when required.

(TIME Differential Float maths) TSC : RDTSC : RDTSCP : TCE supports single and half precision floating-point calculations

Security Relevant Extensions

SVM : Elliptic Curves & Polynomial graphs & function
AES : Advanced Encryption Standard Functions
AVX : 32Bit to 256Bit parallel Vector Mathematics
FPU : IEEE Float Maths
F16b : 16Bit to 32Bit Standards Floats
RDTSCP : Very high precision time & stamp

Processor features: fpu vme de pse tsc msr pae mce cx8 apic sep mtrr pge mca cmov pat pse36 clflush mmx fxsr sse sse2 htt pni ssse3 fma cx16 sse4_1 sse4_2 popcnt aes f16c syscall nx lm avx svm sse4a osvw ibs xop skinit wdt lwp fma4 tce tbm topx page1gb rdtscp bmi1

32Bit SiMD Operations Available on AVX Per Cycle (A Thought on why 32Bit operations are good!)
(8Cores)8*32Bit SiMD(AVX) * 6(times per cycle) * 3600Mhz = 1,382,400 Operations Per Second

*

For RDTSCP = TValue TV1=16.0685 TV2=16.1432 TV3=15.1871
When Processor Mzh = PV1 PV2 PV3
RAND Source = Es1 Es2 Es3

If Xt = 1.9 < then roll right

((TV1 - TV2) * (PV1 - PV2)) / ((TV1 - TV3) * (PV1 - PV3)) = FractorXt(Xt)

Es1 * Xt = Differential

Es2 Es3

(c) Rupert S

Quartz as a diffraction point fractal differentiator : RS

https://science.n-helix.com/2022/02/interrupt-entropy.html

https://tches.iacr.org/index.php/TCHES/article/download/7274/6452
https://perso.univ-rennes1.fr/david.lubicz/articles/gda.pdf
https://patents.google.com/patent/US9335971
*

"Taking spinlocks from IRQ context is problematic for PREEMPT_RT. That
is, in part, why we take trylocks instead. But apparently this still
trips up various lock dependency analysers. That seems like a bug in the
analyser's that should be fixed, rather than having to change things
here.

But maybe there's another reason to change things up: by deferring the
crng pre-init loading to the worker, we can use the cryptographic hash
function rather than xor, which is perhaps a meaningful difference when
considering this data has only been through the relatively weak
fast_mix() function.

The biggest downside of this approach is that the pre-init loading is
now deferred until later, which means things that need random numbers
after interrupts are enabled, but before work-queues are running -- or
before this particular worker manages to run -- are going to get into
trouble. Hopefully in the real world, this window is rather small,
especially since this code won't run until 64 interrupts have occurred."

https://lore.kernel.org/lkml/Yhc4LwK3biZFIqwQ@owl.dominikbrodowski.net/T/

Rupert S

*

Asymmetry dev/random:

Explain it & code it please :D We most certainly know what Asymmetry is in PCI Transactions for GPU & Audio!

The high precision clock source is a CPU feature, but what one forgets is that other processors & network cards have Clock Crystals & So do local networks though the Ethernet Time Sync protocol, PCI Cards with Fast Sync, Repeaters & Boosters..

We need Asymmetric T/T2 or (T * T2)/T3 Etcetera
The main feature is a Timer & The Synchronicity of that timer; Being Asymmetric on time is a feature!

We laugh but yes Asymmetry Is a feature!
But we utilize the Asymmetry to provide CHAOS or Random Patterns,Not Precisely with a single Digit; We may? But we do not have to.

RDTSC is a logical choice for a processor; However our timers can also simply be a tick,
Network Ethernet, PCI-E, Audio BUS, HDD & SSD, Timing Sync Events,
In the case (Example) Network PCI Cards; They do indeed have a precise & variable clock..
In addition they have Network Traffic & Chaotic Packet IRQ; Timed IRQ & Offloaded IRQ & Data,
Also TLS Cypher packets; (Events Sometimes Offloaded & Sometimes not).

In a single System Time Crystals & Sync Events are simply the beginning of "The EventFul Day - Crypto"

Rupert S

Elliptic Curve Erratic Time Diffraction:


Relatively Subtle Timers, Clock Timers from NIC's or Statistical packet flows, Timer offsets & data flow Engrams & Anagrams & Flow patterns, Timers & Interrupts!

But real Timing & Sync Crystals are a work of real logic & Therefor potent in their Patterns & Powerfully influential on the Dynamic Maximum System Potential,

However played or used, Timers & Sync are the heart of a well centered Kye!

So as to timers & statistics; We do have to flow charts though ECC Elliptic Anonymizers.

We frequent the waters of personal & business & We do know so little from that,

Elliptic Curve Erratic Time Diffraction!

Unique Precise clocks & How many? Depends on how Expensive Your Mainframe is! Asymmetry dev/random: Explain it & code it please :D We most certainly know what Asymmetry is in PCI Transactions for GPU & Audio!

Rupert S

VMTGate2022:RS


What we are looking for essentially is 2 things:
Clock differential; As in speed & frequency shifts Electric signal variance,

The time shifting a number that does not guarantee forward (not obligatory),
For example a certificate ECC Elliptic that shifts 0.0005>6 to 4èéç=4 3fdé=5,

However a differential does Vary,

Still need system time to be precise (for Time NTP) & observations of differential are how we adjust..
Imprecision; Crystal Variance & imprecision is a core topic,
But we adapt imprecise results in NTP into precise ones.

Nanosecond TSC : RSTSCP
https://lkml.org/lkml/2022/4/25/57 

Some Random for various needs
https://is.gd/DEV_Random

RS


[PATCH RFC v1 09/10] sparc: use sched_clock() for random_get_entro ... "Jason A. Donenfeld"
[PATCH RFC v1 08/10] um: use sched_clock() for random_get_entropy( ... "Jason A. Donenfeld"
[PATCH RFC v1 07/10] arm64: use sched_clock() for random_get_entro ... "Jason A. Donenfeld"
[PATCH RFC v1 06/10] x86: use sched_clock() for random_get_entropy ... "Jason A. Donenfeld"
[PATCH RFC v1 05/10] arm: use sched_clock() for random_get_entropy ... "Jason A. Donenfeld"
[PATCH RFC v1 04/10] mips: use sched_clock() for random_get_entrop ... "Jason A. Donenfeld"
[PATCH RFC v1 03/10] riscv: use sched_clock() for random_get_entro ... "Jason A. Donenfeld"
[PATCH RFC v1 02/10] m68k: use sched_clock() for random_get_entrop ... "Jason A. Donenfeld"
[PATCH RFC v1 01/10] random: use sched_clock() for random_get_entr ... "Jason A. Donenfeld"
[New] [PATCH RFC v1 00/10] archs/random: fallback to using sched_clock() ... "Jason A. Donenfeld"

https://lkml.org/lkml/2022/4/8/945
https://lkml.org/lkml/2022/4/8/946
https://lkml.org/lkml/2022/4/8/947
https://lkml.org/lkml/2022/4/8/948
https://lkml.org/lkml/2022/4/8/949
https://lkml.org/lkml/2022/4/8/950
https://lkml.org/lkml/2022/4/8/951
https://lkml.org/lkml/2022/4/8/952
https://lkml.org/lkml/2022/4/8/953
https://lkml.org/lkml/2022/4/8/954
https://lkml.org/lkml/2022/4/8/955

Timers
https://lkml.org/lkml/2022/4/9/459
https://lkml.org/lkml/2022/4/9/366

RDTSC
https://lkml.org/lkml/2022/4/9/482

Nanosecond TSC : RSTSCP
https://lkml.org/lkml/2022/4/25/57

*

Random : (Dynamic Elliptic Curve / T) * Factor Of T :

"Problems for Arm (32-bit), Motorola 68000 (M68k), Microblaze, SPARX32, Xtensa, and other niche architectures."

NoJitter - Initiating the dev/random ; Initiating Random with a SEED is the prospect I propose,
My personal Time Crystal RNG is based upon the variable clock rate principle of Quartz clock crystals & could potentially sound too regular.

However as we know very small variabilities in Super Stable Quartz crystals (Factory made) causes doubt,

However in the 0.005 or smaller range & Especially with variable frequencies & power input levels to controlled crystals; Creative Chaos Exists,

Particular market is motherboards that tweak frequencies to improve performance!

Clock rate variance is combined with a seed; As a Factoring agent & Again as a differentiator.

What Is a Factoring Differentiator ? a Math that shifts values subtly & therefor shifts our results from predictable to unpredictable; Well hard to!

The more effort we make; The harder it will be to see our Dynamic Elliptic Curve.

Rupert S

https://www.phoronix.com/scan.php?page=news_item&px=Linux-RNG-Opportunistic-urandom

*****

Serve C-TRNG QT Fractional Differentiator(c)RS


Server C/TRNG Quarts Time * Fractional differentiator : 8Bit, 16Bit, 32Bit, Float Int32 : Fractional Differentiator : fig-mantuary micro differentiator.


SipHash: a fast short-input PRF

Rotation Alignment : "The advantage of choosing such “aligned” rotation counts is that aligned rotation counts are much faster than unaligned rotation counts on many non-64-bit architectures."

http://cr.yp.to/siphash/siphash-20120918.pdf  

https://www.aumasson.jp/siphash/siphash.pdf

"Choice of rotation counts. Finding really bad rotation counts for ARX algorithms turns out to be difficult. For example, randomly setting all rotations in
BLAKE-512 or Skein to a value in {8, 16, 24, . . . , 56} may allow known attacks
to reach slightly more rounds, but no dramatic improvement is expected.
The advantage of choosing such “aligned” rotation counts is that aligned rotation counts are much faster than unaligned rotation counts on many non-64-bit
architectures. Many 8-bit microcontrollers have only 1-bit shifts of bytes, so
rotation by (e.g.) 3 bits is particularly expensive; implementing a rotation by
a mere permutation of bytes greatly speeds up ARX algorithms. Even 64-bit
systems can benefit from alignment, when a sequence of shift-shift-xor can be
replaced by SSSE3’s pshufb byte-shuffling instruction. For comparison, implementing BLAKE-256’s 16- and 8-bit rotations with pshufb led to a 20% speedup
on Intel’s Nehalem microarchitecture."

https://www.kernel.org/doc/html/latest/security/siphash.html

https://en.wikipedia.org/wiki/SipHash

Code SIP-HASH
https://github.com/veorq/SipHash

Serve C-TRNG QT Fractional Differentiator(c)RS

Server C/TRNG Quarts Time * Fractional differentiator : 8Bit, 16Bit, 32Bit, Float Int32 : Fractional Differentiator : fig-mantuary micro differentiator.

As we see rotation may benefact from the addition of Quartz crystal alignment sync data from 4 cycles & aligning data blocks,

Obviously we can pre share 4 64Bit blocks use use a pre seed AES/ChaCha Quad!
Indeed we can have 16 64Bit pre Seeds & chose them by time sync for kernel


Rupert S https://science.n-helix.com

*RAND OP Ubuntu : https://manpages.ubuntu.com/manpages/trusty/man1/pollinate.1.html

https://pollinate.n-helix.com

https://science.n-helix.com/2018/12/rng.html

https://science.n-helix.com/2022/02/rdseed.html

https://science.n-helix.com/2017/04/rng-and-random-web.html

https://science.n-helix.com/2021/11/monticarlo-workload-selector.html

https://science.n-helix.com/2022/02/visual-acuity-of-eye-replacements.html

https://science.n-helix.com/2022/02/interrupt-entropy.html

*

Encryption Methods:

https://tools.ietf.org/id/?doc=hash

https://tools.ietf.org/id/?doc=encrypt

HASH :


https://datatracker.ietf.org/doc/html/draft-ietf-cose-hash-algs

https://tools.ietf.org/id/draft-ribose-cfrg-sm4-10.html

https://tools.ietf.org/id/?doc=sha

https://tools.ietf.org/id/?doc=rsa

Encryption Common Support:


https://tools.ietf.org/id/?doc=chacha

https://tools.ietf.org/id/?doc=aes

SM4e does seem a good possibility for C/T/RNG CORE HASH Functions!


ARM Crypto Extensions Code (Maybe AES Extensions would work here)
https://lkml.org/lkml/2022/3/15/324

ARM Neon / SiMD / AVX Compatible (GPU is possible)
https://lkml.org/lkml/2022/3/15/323


*

197 FIPS NIST Standards Specification C/T/RNG https://science.n-helix.com/2022/02/interrupt-entropy.html


Only a Neanderthal would approve a non additive source combination that is injected into the HASH & Re-HASHED ,

One does not Procreate inadequate RANDOM from a simple bias KERNEL, Hardware RNG's added together may add around 450% Complexity!

Hardware RNG devices MUST be able to Re-HASH to their 197 NIST Standards Specification, That is FINAL 2022 DT

KEYS: trusted: allow use of kernel RNG for key material

https://lkml.org/lkml/2022/3/16/598

CAAM PRNG Reference : https://lkml.org/lkml/2022/3/16/649
Posted by at No comments:

Thursday, February 17, 2022

Visual acuity of Eye Replacements

Improvements of Visual acuity of Eye Replacements


Visual acuity of Argus II (60 electrodes) and alpha-IMS (1500 electrodes)

Rupert Summerskill 2022 Advocate of WHO & MSF Medical Sans Frontier

https://who.org https://msf.org/ https://msf.fr

https://www.tensorflow.org/versions#tensorflow_2

https://pytorch.org/

https://pypi.org/project/openvino/

https://bit.ly/VESA_BT

Argus® II Retinal Prosthesis System Surgeon Manual
https://www.accessdata.fda.gov/cdrh_docs/pdf11/h110002c.pdf

Performance specification examined : Full Study
https://www.ncbi.nlm.nih.gov/pmc/articles/PMC3926652/
https://www.ncbi.nlm.nih.gov/pmc/articles/PMC3926652/pdf/nihms551491.pdf

Bio-Modifiers & Eyes & ears + Flexible and Stretchable Bioelectronics
https://www.mdpi.com/1996-1944/15/5/1664
https://www.mdpi.com/1996-1944/15/5/1664/pdf

Modelling, Simulation and Analysis of NPDA for Sub-retinal implant using Nano Materials
https://iopscience.iop.org/article/10.1088/1757-899X/1225/1/012010/pdf

prostheses list : Body part replacement list thank you Australia 2022-02
https://www.health.gov.au/sites/default/files/documents/2022/02/prostheses-list-part-a-prostheses-list.xlsx


Bullet points : Key issues of neuroleptic surgery for seizures for example : Observable small twitching in the eyes shows that single nerves resolve impulse..

According to my studies :


Brain bit precision suggests 5 to 8Bit signals per diode may interact with Nerve cells ideally..

7Bit is cynically a rarer case; However provide us with a 14 Bit signal to resolve or the 40Bit potentially in EYE Cells & the brain may learn as we progress towards a higher resolution resolve ..

On the diode signal : Digital & Analogue : However in analogue 32Bit it at least arguably premium for us;

https://science.n-helix.com/2021/03/brain-bit-precision-int32-fp32-int16.html

Haptic sensation (usable in many instances with training to resolve sensation into 3D & may be utilized to resolve internal brain tissue 3D Imaging & feeling by comprehension of the facts surrounding 'Simple Feeling'

https://science.n-helix.com/2021/11/ihmtes.html

Wave ANC may resolve overlapping wave issues such as waving lines and mores patterns of imaging & feeling:

https://science.n-helix.com/2021/11/wave-focus-anc.html

Temporal aliasing may improve both the level of voltages in the electrodes & increase cross diode interactions..

But also improve sensor processing.

https://science.n-helix.com/2021/09/temporal-aliasing-image-shaping-polygon.html

https://science.n-helix.com/2021/03/upscaling-enhancement.html

CPU Design may be improved & code:

https://science.n-helix.com/2021/10/the-principle-of-inversion-sign-sign-crs.html

https://science.n-helix.com/2021/02/multi-operation-maths.html

https://science.n-helix.com/2021/11/parallel-execution.html

Bionics & Medical

https://science.n-helix.com/2022/11/variable-sensitivity-cable-technology.html

https://science.n-helix.com/2022/03/fsr-focal-length.html

https://science.n-helix.com/2014/02/neural-interfaces-through-proxy-feeling.html

https://science.n-helix.com/2014/02/revolutionary-brain-surgeries-that.html

https://science.n-helix.com/2013/06/ideas-for-no-armed-lady-c-rs.html

https://science.n-helix.com/2014/01/the-open-source-medical-device-for.html

https://science.n-helix.com/2013/09/self-healing-polymer.html

Key issues (8–10 bullet points summarizing the review)


Performance in relatively simple visual tasks, e.g. object localization, improved in nearly 100% of the tested Argus II subjects

More complex tasks, e.g. detection of motion, improved in approximately 50% of Argus II subjects.

An orientation and mobility (O&M) task based on walking towards a high-contrast target, or walking along a high-contrast line on the floor improved significantly when using the implant in a grouped analysis of Argus II subjects.

The differences between reported visual acuity of Argus II (60 electrodes) and alpha-IMS (1500 electrodes) wearers are small, despite the theoretical 8 times lower resolution of the Argus II device.

Retinal implant functionality is likely limited by many factors including physical (e.g., channel interactions), physiological (e.g., retinal degeneration) and human factors (e.g., the patient’s capability to comprehend prosthetic vision)

Retinal implant functionality is limited by many factors including electrode-electrode interactions and a sub-optimal tissue-electrode interface. At present, hardware engineering factors, such as electrode size and electrode density, may be of lesser importance.

Vision processing strategies, patient screening methods and optimizing the electrode-tissue interface are aspects of implant functionality that can be improved in the future.

The Argus II device will be continuously improved, including the implementation of advanced vision processing strategies, zooming, eye scanning, and colour coding.

Within 5 years from now, SSMP hopes to implant more than 2000 Argus II devices worldwide.

According to current plans, the next generation SSMP device will be a high-acuity retinal implant with 240 electrodes and a cortical 60-electrode implant.
Posted by at 1 comment:

Sunday, February 6, 2022

RDSEED, Random & Entropy Security & Information protection : Kernel & Processor Development

RDSEED, Random & Entropy Security & Information protection : Kernel & Processor Development


Kernel Dev : To be fair flawing AES Filtered Seeds with Doping would be an answer for people that feel distrust for (As far as i am concerned "A Perfect Security HASH" RS)"random: use computational hash for entropy extraction"

To be fair flawing AES Filtered Seeds with Doping would be an answer for people that feel distrust for (As far as i am concerned "A Perfect Security HASH" RS)"random: use computational hash for entropy extraction"

But bear in mind that Rupert's Cross mixing does take at least 3 CPU Cycles if you do not use:

MMX/AVX 16Bit multiple line Byte Swapping.

And let's go deeper and Hash again ? 8 Cycles!

Performance is key, SiMD Crucial, Dopping? A Thought (Does this scare you? Yes)

Perfect operations is IO DeKeyed low priority CPU Process (GPU RAND's Exist read my post)

Rupert S https://science.n-helix.com

Sources :

https://science.n-helix.com/2022/02/interrupt-entropy.html 

https://science.n-helix.com/2018/12/rng.html

https://science.n-helix.com/2017/04/rng-and-random-web.html

https://science.n-helix.com/2021/11/monticarlo-workload-selector.html

https://science.n-helix.com/2020/06/cryptoseed.html

https://science.n-helix.com/2019/05/zombie-load.html

https://science.n-helix.com/2018/01/microprocessor-bug-meltdown.html

random: use computational hash for entropy extraction

*

On 2/5/22, Dominik Brodowski wrote:

> Why are we only using RDRAND here, and not RDSEED?

Simply because that's what was already used here; I didn't revisit the

old decision. It seems like any changes there should be made in a

separate patch with its own justification. If you think there's a good

rationale, feel free to send that.


Part of why these changes are so gradual is because much of random.c

isn't my code originally. Were it mine, I'd presumably know all my

various rationales and be able to rapidly think within them and

re-evaluate. But because that's not the case, I find that I'm spending

a lot of time trying to reconstruct the original rationales of its

authors. IOW, rather than saying, "I don't get this, must be bad," I'm

trying to do a little bit of archaeology to at least make sure I know

what I'm disagreeing with, if I even disagree at all. That's time

consuming in part, but also is part of doing things evolutionarily.


With regards to RDRAND vs RDSEED, just off the top of my head -- I'm

writing this email on my phone -- I think extract_entropy/extract_buf

used to be used as part of /dev/random's blocking stream, which

ostensibly could mean more frequent calls, once every 10 bytes IIRC.

Nowadays it's only called once every 5 minutes (per numa node), so

maybe RDSEED could make sense? Or maybe there are other reasons to

unearth, or none at all. We'll have to look and see.

Jason

*

*




Each Zip presents 8 x 1MB present 2048 x 4096KB HASH Object or if you probably like 8100+ Multi sorted HASH RAND Objects : 8 Way sorted & hashed : RS 2022-02-02

2 cypher Seed key random : Random Initiator : Linus' 50ee7529ec45 : RS


(Especially MIPS) getting that Router /dev/random 2 cypher Seed key random : Random Initiator : Linus' 50ee7529ec45

yes MIPS are used in routers & some phones!

the proposal is to utilize & day to 8 day pre seeding & Haveged cored monte-carlo workload selector & therefore provide for Mitigation on many fronts while improving performance

*RAND OP Ubuntu : https://manpages.ubuntu.com/manpages/trusty/man1/pollinate.1.html

https://pollinate.n-helix.com

https://science.n-helix.com/2021/11/monticarlo-workload-selector.html

https://science.n-helix.com/2021/11/parallel-execution.html

https://science.n-helix.com/2019/06/kernel.html

https://science.n-helix.com/2022/02/rdseed.html

https://is.gd/FastCRNG

"Alternative mitigation involves moving process-related information in the kernel into a process-local part of the kernel address space. A user-space attacker that can infer the content of its associated kernel page table can thus only read information about its own process. Switching between these kernel address spaces is done as part of the normal address space switch when a thread in a different process is scheduled and thus comes with no additional cost."

https://www.phoronix.com/scan.php?page=news_item&px=Specmelt-No-Cost-Research

"You're proposing a middle way here, which would be to
just call try_to_generate_entropy() (the "Linus Jitter Dance" code) if
!crng_ready() in /dev/urandom and getrandom(GRND_INSECURE)"

"The justification for always waiting for randomness and never
returning insecure randomness to userspace isn't so much about
simplifying the code -- this patch isn't very large anyway -- but
rather for simplifying userspace crypto footguns. After several
decades of endless user confusion, we'd finally be able to say, "use
any single one of our random interfaces and you'll be fine. They're
all the same. It doesn't matter.""

https://www.spinics.net/lists/linux-crypto/msg61415.html
Posted by at No comments:

Sunday, January 30, 2022

NTP Time Accuracy report 9:48 AM RS

NTP Time Accuracy report 9:48 AM RS


Time optimizes & secures our network & provides crypto RAND : Why can't we answer more? @1ClockCycle * 200000 @1% CPU + SSL & TLS & TSL (Transaction Security layer) :

If you want to tier 1 to 3 : clearly and openly source from t1 as your main priority, GSM is clearly 3G+ 4G + 5G & obviously has sweet traffic if you connect a mobile box!

However Satellite sources EG locators are a primary source, however in the past
(Upto 5 minutes discrepancy in 1996) :

So a satellite receiver IS a primary T1 source & clearly big antenna arrays are a primary proven quality, GSM or a university with both a DISH & atomic clock regulator : Being realistic though! Gravity waves cause differential : RS 2022-01


For those curious about NTP Packets, Here is an ideal video!
https://is.gd/NTP_PacketVideo
https://is.gd/PTP_PacketVideo


https://is.gd/79erNTP_Logs

https://datatracker.ietf.org/doc/draft-ietf-ntp-over-ptp/

*145.238.203.14 .MRS. 1 u 24 64 375 31.165 +23.023 3.720
+62.108.36.235 40.95.204.66 3 u 49 64 375 43.421 +23.321 10.071
+193.52.184.106 .LTFB. 1 u 16 64 277 42.448 +25.057 3.641
+162.159.200.123 10.19.12.255 3 u 25 64 375 31.224 +24.133 1.413
+132.163.97.6 .NIST. 1 u 68 64 376 152.252 +23.785 6.087
+204.9.54.119 .GPS. 1 u 23 64 375 122.251 +23.415 9.097
+82.64.203.110 .GPS. 1 u 59 64 357 33.211 +23.449 7.489
+65.100.46.164 .SOCK. 1 u 28 64 375 178.048 +22.276 7.227
#185.216.231.116 52.239.121.49 3 u 5 64 377 172.191 +26.606 6.876
+216.239.35.8 .GOOG. 1 u 7 64 357 34.040 +23.026 18.504
+131.176.107.13 .MRS. 1 u 9 64 337 46.816 +22.210 11.299
+129.134.27.123 .FB... 1 u 16 64 377 46.187 +23.891 10.263
#104.194.242.237 127.67.113.92 2 u 174 64 374 169.249 +28.483 6.345
#40.119.148.38 25.66.230.4 3 u 40 64 375 40.506 +29.784 13.406
78.121.185.77 .STEP. 16 u 12h 1024 0 0.000 +0.000 0.000
+139.143.5.30 139.143.45.145 2 u 170 64 174 39.670 +23.620 7.925
+139.143.5.31 139.143.45.145 2 u 28 64 335 40.564 +22.166 6.807
+130.159.196.118 193.62.22.90 2 u 60 64 177 49.497 +22.928 10.997
78.121.191.46 .STEP. 16 u - 1024 0 0.000 +0.000 0.000
172.66.43.67 .STEP. 16 u - 1024 0 0.000 +0.000 0.000
+162.159.200.1 10.19.12.255 3 u 45 64 275 31.572 +23.871 4.540
+51.158.147.92 131.188.3.220 2 u 55 64 377 39.000 +22.102 5.628
+132.163.97.3 .NIST. 1 u 43 64 175 151.470 +22.629 7.905
#200.160.7.197 .GPS. 1 u 24 64 375 225.888 +28.540 5.028

https://is.gd/SecNTP4U

https://is.gd/AppCache2m

https://is.gd/AppCacheJSZip

https://is.gd/LinuxHPCNode

https://bit.ly/VESA_BT

*RAND OP Ubuntu : https://manpages.ubuntu.com/manpages/trusty/man1/pollinate.1.html

(copy this text, for your server) *pollinate* /dev/rnd every 3 hours if you like:
sudo pollinate -r -i -s https://entropy2.n-helix.com
sudo pollinate -r -i -s https://entropy.n-helix.com

Each Zip presents 8 x 1MB present 2048 x 4096KB HASH Object or if you probably like 8100+ Multi sorted HASH RAND Objects : 8 Way sorted & hashed : RS 2022-02-02

https://is.gd/SecurityHSM
https://is.gd/WebPKI

PTP Server Clock Sync with NTP https://is.gd/PTP_TimeStream
NTP64 Server (run after PTP) https://is.gd/NTP_Server

PTP Server Clock Sync https://is.gd/PTP_Low_Latency_Time

TLS Optimised https://drive.google.com/file/d/10XL19eGjxdCGj0tK8MULKlgWhHa9_5v9/view?usp=share_link
Ethernet Security https://drive.google.com/file/d/18LNDcRSbqN7ubEzaO0pCsWaJHX68xCxf/view?usp=share_linkhttps://www.accubeat.com/ntp-ptp-time-servers
https://www.acquisys.fr/product-category/nos-produits/temps-frequence/

Network Time Protocol Version 4: Protocol and Algorithms Specification
https://datatracker.ietf.org/doc/rfc5905/

https://datatracker.ietf.org/doc/draft-ietf-ntp-over-ptp/



Genuinely good JS + Python & configuration work, Windows, Linux, ARM

ML tensor + ONNX Learner libraries & files
Model examples in models folder

https://is.gd/DictionarySortJS
https://is.gd/UpscaleWinDL
https://is.gd/HPC_HIP_CUDA

https://is.gd/UpscalerUSB_ROM

https://is.gd/OpenStreamingCodecs

https://is.gd/AMDPro2024PolarisCombined

The perfect Proposal RS

* Time Server Pools

https://is.gd/NTPServiceProof

NTP , PTP (time services) & DNS ntp16.nx7v.icu node, 100MB in & out (Current) Latency 17ms
NTP , PTP (time services) & DNS ntp16.dn.n-helix.com node capacity superb ;)
NTP , PTP (time services) ntp17.dn.n-helix.com node capacity superb ;)
NTP , PTP (time services) time-16.nx7v.icu node capacity superb ;)
roughtime (time services) roughtime.dn.n-helix.com node capacity superb ;)

These are the addresses directly of some good ones; DNS & NTP & PTP 
2602:ff23:50:3c2::1
2604:6600:2000:2b::1
2604:6600:2000:45::1
2a06:98c1:54::c12b
142.202.190.19
172.64.36.1
172.64.36.2
108.181.201.22
108.181.165.159

DNS & NTP
https://dns.nx7v.icu
https://dnsL5.nx7v.icu
https://dns-e.nx7v.icu
https://ntp17.dn.n-helix.com
https://ntp16.dn.n-helix.com


google, FB, Amazon
time13.nx7v.icu

esa

CF


*



*

PTP & NTP Timing Synchronisation https://ntppool.org


Many small islands & Isolated places do not have a time service, A simple GSM receiver for gsmd solves the issue of high latency on the internet,
While many could not contact the world..
They could still have higher quality conversations with PTP & NTP Timing Sync over networks

https://www.ntppool.org/zone/africa
https://www.ntppool.org/zone/asia
https://www.ntppool.org/zone/europe
https://www.ntppool.org/zone/north-america
https://www.ntppool.org/zone/south-america

*

USB NTP GSM Navigator, Android, Linux & Windows NTP & PTP Time Server Synchroniser Crystal Galileo & GlobalSAT

I have very positive results with these GSM Receivers,

*
The GSM unit is 10$ to 20$, the GSM unit is a satellite connector and location device..

Because the gsm Satellite connector contacts an Atomic clock time server (The Satellite); Your time server will be very accurate ...

Your Time server will have a proven Clock Sync & therefore be observed as good & also a faithful time keeper.

RS
*

You need to raise the Baud rate in Serial drivers from 9600 to as high as possible & set hardware control to on;
Recommended for accuracy & speed, do this for all CON/Serial devices,
This helps even the earbuds in Bluetooth.

Time server Atomic clock NTP is Galileo satellite ring GSM Global positioning, saving millions of sailors & pilots worldwide every year (signed RS) & is upgrading my work every day at https://ntp.org https://www.ntppool.org/scores/162.159.200.1

NIST : https://drive.google.com/drive/folders/1W_rxGJoGthRRGsnbZ1Q_SSsBat6tQ7iO?usp=sharing
Time.is : https://drive.google.com/drive/folders/1eqtsa1m0cljAICwc_D5z89wOLh9LjoeZ?usp=sharing

FR : USB NTP GSM Navigator

USB NTP GSM Navigator, Android, Linux & Windows NTP & PTP Time Server Synchroniser Crystal Galileo & GlobalSAT

https://www.amazon.fr/Navilock-NL-8012U-Module-R%C3%A9cepteur-Interne/dp/B00R998MJQ/

https://www.amazon.fr/XIANZI-dordinateur-Portable-r%C3%A9cepteur-g-Souris/dp/B095WRKCYB/

https://www.amazon.fr/R%C3%A9cepteur-Pr%C3%A9cision-Positionnement-Navigation-Crystal/dp/B0C59G2C97/

DE : USB NTP GSM Navigator

https://www.amazon.de/-/en/SEAFRONTmh4y0z1xkd/dp/B0C7XHK5Z9/ref=sr_1_3?keywords=USB+GPS+Module&qid=1687385116&sr=8-3

https://www.amazon.de/-/en/Notebook-Interface-Information-Navigation-Receiver/dp/B0C6NM33HR/ref=sr_1_5?keywords=USB+GPS+Module&qid=1687385116&sr=8-5

https://www.amazon.de/-/en/EBTOOLSs06f178my4/dp/B0C37H1V5F/ref=sr_1_8?keywords=USB+GPS+Module&qid=1687385116&sr=8-8

https://www.amazon.de/-/en/Receiver-Navigation-Interface-DC3-3V-5V-Accessories/dp/B0BQJBZD9W/

*

6000+ NTP serves per second + MD5 verification, GPS, Beidou, GLONASS, QZSS & 100ns Clock Precision & Automatic network IP Obtainment,

Personally good for ntppool.org NTP & PTP (with server)

https://www.aliexpress.com/item/1005006199371815.html

https://is.gd/NTPSetupMan

Rupert S

*

*ntp-p1.obspm.fr .MRS. 1 u 471 512 367 10.828 +1.165 0.485
+time1.esa.int .MRS. 1 u 1 512 367 22.276 +0.104 2.667
+saturne.obs-bes .LTFB. 1 u 76 512 337 20.155 +1.469 1.894
+dns.3eck.net 126.181.115.189 3 u 10 512 377 30.528 -1.234 0.459
#time-c-b.nist.g .NIST. 1 u 32 512 373 129.406 +0.025 1.333
+time.cloudflare 10.19.12.255 3 u 43 512 337 9.288 +1.586 0.718
+ntp.your.org .GPS. 1 u 30 512 367 100.022 +2.367 2.160
+bethany.fangfuf 193.204.114.232 2 u 30 512 337 14.408 +1.358 0.278
#r3s1stanc3.me 184.255.239.151 4 u 512 512 377 14.254 -3.834 0.253
#ns2.att.wlg.tel 131.203.16.6 2 u 476 512 367 293.444 -0.789 0.268
+time3.google.co .GOOG. 1 u 492 512 377 14.309 +1.211 0.700
+time4.facebook. .FB... 1 u 35 512 337 9.844 +1.361 1.428
#router-vzb.serv 193.52.136.2 3 u 29 512 367 10.695 +0.078 2.637
+51.145.123.29 25.66.230.2 3 u 505 512 377 17.403 +1.435 1.496
+ntp1.cis.strath 193.62.22.90 2 u 250 512 367 27.780 +1.240 1.131
+time2.google.co .GOOG. 1 u 59 512 377 13.367 +1.436 0.330
+time.cloudflare 10.19.12.255 3 u 108 512 337 9.217 +1.960 0.860
+178.249.167.0 ( 138.96.64.10 2 u 105 512 367 15.412 +3.468 0.442
#time-a-b.nist.g .NIST. 1 u 30 512 377 129.818 +0.546 0.388
#62.108.36.235 ( 40.95.204.66 3 u 133 512 377 22.604 +0.851 1.367

*145.238.203.14 .MRS. 1 u 219 256 377 9.933 +0.284 1.756
+131.176.107.13 .MRS. 1 u 12 256 377 22.488 -0.634 0.463
+193.52.184.106 .LTFB. 1 u 46 256 377 20.052 +0.304 1.814
+62.12.167.109 126.181.115.189 3 u 41 256 377 29.533 -2.098 0.209
#132.163.96.3 .NIST. 1 u 7 256 377 130.010 +0.120 1.695
+162.159.200.1 10.19.12.255 3 u 28 256 377 8.865 +1.104 3.641
+204.9.54.119 .GPS. 1 u 9 256 377 99.192 +1.234 2.576
+151.80.32.71 193.204.114.233 2 u 11 256 377 14.897 +0.409 2.913
#37.187.101.179 184.255.239.151 4 u 240 256 377 13.753 -4.953 1.743
#103.242.70.5 131.203.16.6 2 u 226 256 377 293.146 -1.442 2.088
+216.239.35.8 .GOOG. 1 u 259 256 377 13.548 +0.470 1.384
+129.134.26.123 .FB... 1 u 8 256 377 9.618 +0.364 0.388
#194.177.34.116 193.52.136.2 3 u 17 256 377 9.282 -0.588 0.169
+51.145.123.29 25.66.230.1 3 u 240 256 377 17.663 +0.752 0.656
#130.159.196.117 193.62.22.66 2 u 222 256 377 27.708 +2.997 2.300
+216.239.35.4 .GOOG. 1 u 245 256 377 13.879 +0.284 1.821
+162.159.200.123 10.19.12.255 3 u 26 256 377 8.629 +0.921 0.813
+178.249.167.0 138.96.64.10 2 u 23 256 377 14.712 +2.366 0.563
+132.163.96.1 .NIST. 1 u 29 256 377 129.839 -0.184 1.422
#62.108.36.235 40.95.204.66 3 u 255 256 377 23.121 -0.212 1.319

*ntp-p1.obspm.fr .MRS. 1 u 226 256 377 10.356 +0.759 0.548
+time1.esa.int .MRS. 1 u 21 256 377 22.389 -0.262 0.740
+saturne.obs-bes .LTFB. 1 u 48 256 377 20.052 +0.304 0.785
+dns.3eck.net 126.181.115.189 3 u 32 256 377 29.533 -2.098 0.329
#time-c-b.nist.g .NIST. 1 u 19 256 377 130.035 +0.162 0.486
+time.cloudflare 10.19.12.255 3 u 67 256 377 9.186 +1.694 1.482
+ntp.your.org .GPS. 1 u 49 256 377 98.802 +1.585 1.093
+bethany.fangfuf 193.190.230.65 2 u 57 256 377 14.257 +0.570 1.307
#r3s1stanc3.me 184.255.239.151 4 u 18 256 377 13.753 -4.953 1.343
#ns2.att.wlg.tel 131.203.16.6 2 u - 256 377 293.146 -1.442 2.090
+time3.google.co .GOOG. 1 u 32 256 377 13.570 +0.395 1.257
+time4.facebook. .FB... 1 u 43 256 377 9.618 +0.364 0.396
#router-vzb.serv 193.52.136.2 3 u 44 256 377 9.282 -0.588 0.297
+51.145.123.29 25.66.230.1 3 u 260 256 377 17.364 +1.530 0.765
#ntp1.cis.strath 193.62.22.66 2 u 14 256 377 27.688 +3.240 0.212
+time2.google.co .GOOG. 1 u 49 256 377 14.013 +0.228 0.918
+time.cloudflare 10.19.12.255 3 u 99 256 377 8.616 +1.204 0.441
+178.249.167.0 ( 193.190.230.65 2 u 112 256 377 14.736 +1.826 1.028
#time-a-b.nist.g .NIST. 1 u 42 256 377 129.704 +0.126 1.547
#62.108.36.235 ( 40.95.204.66 3 u 81 256 377 22.682 +0.575 1.735
Posted by at 1 comment:

Sunday, January 2, 2022

SBTM: Source Based Tone mapping : (c)RS

SBTM: Source Based Tone mapping : (c)RS


Feel source based may be good if one knows the ICC Profiles of the display

Definite reason : Desktop windows with multiple ICC Colour pallets Dynamic Colour Range.

Example: We take desktop of Mac, PC, Phone & Define Master ICC Profile Frame buffer, We take small windows & Define a colour gamut & WCG & Dynamic range..

Within a frame buffer of 48Bit by blitting + DMA from a Sub Cache Multiple window with multiple memory frames that are meta data enabled small memory footprint & Multiprocessing & Threading enabled.

We can therefor with VRR load a single part of the frame; On a 8 Core CPU with AVX & SiMD quite relevant!

We can single frame tone-map from source & from TV to advantage total transmittable data (Only 48GB/s!)

Screen composure: Multi Window HDR and Variable pallet screen composure for monitors,
Computers & TV & GPU DAC


2 primary methods:

Full Light spectrum Composure frame with Palleted Virtual boxed renders
(can be 8Bit, 15Bit, 16Bit, 24Bit, 32Bit, 40Bit, 48Bit)
With HSL Light to dark (Composed on Dark, Alpha)
with Light spectrum in 8Bit, 10Bit, 12Bit, 14Bit, 16Bit per channel.

Frame buffer source can be Meta Data by spectrum & Light range :
HSL L<>D 8Bit <> 16Bit (Alpha Channel) + R,G,B 8Bit <> 16Bit per channel
+ Frame rendered in colour space..

& Dither down on DAC

Or Render all frames in the same Bit Depth & compose in linear colour space 48Bit & Dither down on DAC

Composure into high colour space saves RAM but does allow the final composure layer to dither into a higher colour range 48Bit for example with 16Bit colour pallets in the frame buffer.

Rupert S https://science.n-helix.com

https://bit.ly/VESA_BT

Colour Range Example Final Fantasy XVI HDR

https://www.youtube.com/watch?v=vFtqbjf1jjI

Cut Negativity but answers are to be found!

Research topic RS : https://is.gd/Dot5CodecGPU https://is.gd/CodecDolby https://is.gd/CodecHDR_WCG https://is.gd/HPDigitalWavelet

Posted by at No comments:
Subscribe to: Comments (Atom)