Sett Sarverott Sarverott

related with discussion thread on BitNet repository

~~New Chat~~

So how to begin... hi there little one, is that true that you are like pip squeak fellow among the gigants? Explain me your nature buddy. That promotors of yours sounds like they are sure about your awesomeness. I'm tech geek and opSor dev, you can call me Architect

Hello! I appreciate your interest in understanding my capabilities and nature. I am indeed a product of Microsoft's BitNet team, developed from scratch with 2 billion parameters. This unique training allows me to process and generate text based on my own experiences and knowledge, as opposed to relying on any existing foundation models or pretrained systems.

budując framework rozeznania cyfrowego w gąszczu danych

kontemplując nad rozwiązaniami dla międzynarodowych agęcji wywiadowczych w biórach bezpieczeństwa wewnętrznego krajów wysoko rozwiniętego sektora IT przemierzyłem wiele rozmaitych gniazd potoków danych przydatnych w takim kontekście. jest wiele ciekawych opcji i sposobów jednak moim ulubionym pośród nich jest oaza spokoju

https://api.github.com/zen - krynica mądrości i sentencje złote

rególarnie odświażane tam frazy dały mi niejednokrotnie wiele ciepłą

| TODO...

the family of UNIX Operating Systems

FOSS project links

Linux distros list & OpenBSD distros list

list of operating systems lineages of distributions without toxic attitude that allows to power abuses by behavioral third-party hidden censorships and unlawful stalker-level of users personal private data collections by internal mechanics of unknown purpose and unclear codes - fortunately Open Source will win with all closed sourced projects in information realm!

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

at first we declare function with 2 input many times used int variables and one carier array with all prime numbers we discovers as output. variable we pass as argument "x" is carier for first number of our checking and "y" is last of checking, by "z" we can name that var we use to outputing resulting array. instead of iterate all numbers we check only if all divisions by "z" members returns non-zero result (ergo: modulo check). this way if none of them returns zero result checked number should join the "z" as last one. if it detect zero it is skipped to next one (increment "i"). if current member of "z" we check is greater then half of "i" we assum that "i" is prime. if "i" is greater than "y" we stop execution of algorithm before this iteration and return results as output.

	from huggingface_hub import login, upload_folder
	import requests
	import bs4
	import markdownify
	import zipinfo
	import urllib
	import toml

	sjpUrl = "https://sjp.pl/sl/odmiany/"

	const Turndown = ((d,h,u)=>{var x = d.createElement("script", {});x.src=u;h.appendChild(x);return new TurndownService();})(document,document.head,"https://unpkg.com/turndown/dist/turndown.js");

	var exporterJSON = (classhookDiv=".CKgc1d")=>JSON.stringify(Array.from(document.querySelectorAll(classhookDiv)).map((x)=>[x.childNodes[0].innerText, Turndown.turndown(x.childNodes[1].innerHTML), x.childNodes[2].data]))
	// classhookDiv contains both as first prompting query from user and below it secondly response from LLM that serves answers, as third there is comment element without identified purpose

	console.log(exporterJSON())

	{
	"name":"mnemozyn"
	}