- cypherpunks - lists.cpunks.org

Re: Volla Punks
by Alshen Feshiru 24 Nov '25

24 Nov '25

If you or your team haven't executed a SAI-288 Cryptography, On Thursday, November 27, 2025, it is likely that I will revise or upgrade SAI-288 to a better version, and I will immediately tell Pseudocode, Do you mind waiting for Pseudocode SAI-288? If it doesn't matter, then I'll be back again on Thursday. Big Thanks. ---- On Mon, 24 Nov 2025 19:22:07 +0900 info(a)volla.online wrote ---- Dear Mr Feshiru, Thanks for your clarification. We can offer our existing or upcoming devices for your project. Please note, that the development of a custom smartphone from the scratch requires an investment of about 5 Million Euro. We are usually working with Mediatek Chipsets. The upcoming successor device of Volla phone X23 comes with a Dimensity 7300 SoC, quite powerful. We may introduce the successor device of Volla Phone Quintus with a SoC of the Dimensity 8000er line. Please also note, that can’t use a Mainline Linux Kernel for a mobile device. It’s will be an Android Linux Kernel. The successor device of Volla Phone X23 comes with an Android Linux Kernel 6.1, quite new for mobile devices. For the successor device of Volla phone Quintus we may be able to go with an Android Linux Kernel 6.7 or newer. We can for sure modify the Kernel concerning your technical requirements. Can you please summarize your requirements on a high level? You want to use a different user data encryption or different network protocol? On Android this would be possible with a VPN. If you use Ubuntu Touch as a base system you have more options. With kind regards Dr. Jörg Wurzer Am 23.11.2025 um 13:54 schrieb Alshen Feshiru < mailto:alshenfeshiru@zohomail.com >: I'm going to break down what I really need right now, The answer is to Produce a new Smartphone called Volla Punks or Alshen Punks (If allowed) I can't handle all of them, but as much as I can, I can give code or technical instructions from Cryptography and Lithography in a concrete way. Don't Trust; Verify. With Custom Volla OS -> Hashing will prioritize SAI-288 and therefore Multi Languages on Java, C++, RUST, Swift, Python which makes it easier for your Programmers to process these Programming Languages -> Modified the SAI-288 to focus on BIG ENDIAN and ROTR where you can read references from https://github.com/MiCode/Xiaomi_Kernel_OpenSource/issues/40399 -> Exact 2 numbers before 288 then Simplify Exponential From the first definition onwards then this will create an identity input or this becomes a recommendation for identity input -> Cryptography for the security of a network can implement Narrowband IOT with Cat-NB2 standard and for digital signatures it is better to choose Dilitihium2 which you can get from the Open Quantum Safe library or anywhere else except Bouncycastle -> For the Lithography or SoC part, I should choose the Snapdragon 870 5G because I have never created a Chipset on my own unless you want to help -> If possible, to implement a Custom Chipset e.g. with a name Midcells 777 with 3nm (If possible) that is, not only from one person's idea, my idea is limited to this, my idea about Custom Chipset is that Boolean must be precise first before ENDIAN reaches the target -> Charging speed should be enough 21W = That's all I can give, but if you have a technical question about Cryptography or Soc Lithography or if you want to ask questions like "Where should I place the definition of Cryptography Mathematics A?" SAI-288 cryptography anyone can import even the programmers on your team can execute in front of their computers. ---- On Sun, 23 Nov 2025 20:03:49 +0900 mailto:info@volla.online wrote ---- Hello again We can offer our existing devices or upcoming ones. What are you requirements to a smartphone? I assume you want to have a custom operating system with your own encryption features? Volla OS for sure already uses several encryption and signing technologies to protect the integrity of the system and user’s data. Do you want to sell your own devices with your own brand? Or would you like to be come a reseller? Or are you interested to contribute to the evolution of Volla OS as a community developer? Did you already develop your own Android or mobile Linux fork? With best regards Dr. Jörg Wurzer Am 23.11.2025 um 03:58 schrieb Alshen Feshiru < mailto:alshenfeshiru@zohomail.com >: The name Alshen Feshiru is honestly just a Pseudonym and I am not tied to a Company or anything Centralized, but I can or can help to be marketed not only in Europe but also Southeast Asia. If it is true that you agree to the proposal about this Cryptography collaboration for such as Producing a new Smartphone, if it is necessary to input Data or Forms, What should I fill out? because maybe your team can only log in or execute coding from the Server or Software Volla, whereas I may not be allowed, please note again that I will only help or give a map of Cryptography and Lithography, not all of them have to be Custom, sometimes the Standard is much better because it has been tested for dozens, decades. Best Regards, Alshen Feshiru ---- On Sat, 22 Nov 2025 23:37:27 +0900 mailto:info@volla.online wrote ---- Dwar Mr Feshiru, Thanks for your message and interest in our products. Not only do our smartphones and tablets seem to be a perfect fit for your needs, but so do our Volla Cloud with distributed data processing and storage, as well as our research into the Volla Meshnet as a distributed infrastructure for data transmission. As a retailer, you are welcome to sell our products with accessories. We also offer business customers the option of customizing the operating system and dual branding. With a planned smartphone, we could also offer your logo exclusively on the back of the device. Business customers can also flash our devices themselves. One of our customers is doing so. Let me know if are interested in a quote. If so, we would need the contact data of your company. With best regards Dr. Jörg Wurzer Actually I am interested in a product called Volla Phone Quintus and a coincidence I am the youngest former Cryptographer, Alshen Feshiru is just a Pseudonym name, but actually I am creating Software for anyone will get complete privacy, IP Location will be Pseudonymous and some intended Devices will get the Internet that no longer requires a centralized provider, As long as the electricity is scattered in the Oscillator moving upwards called Upward, it will defeat all attackers. Or it is possible for us to produce a new Smartphone from Volla, For example, with the name Volla Punks , you can also contact me this email or have a further conversation on the Cypherpunks mailing list, I am used to and almost always have conversations there if needed such as Cryptography consultations, Lithography and everything related to Decentralized privacy. I only help the Cryptography part either in mathematical calculations or modifications that are completely Decentralized, Anti-Bias Optoelectronics and coding decisions or something like that can be decided by your Production Team, I just give a map, I have a standalone Cryptography which is SAI-288 with Multi Languages, Anyone can Implement this with the JAVA Main Language but the other languages are C++ and Rust and Python and Swift, You can modify other Multi Languages to suit your needs but it would be better, the control is not on the Team or Vendor, import java.nio.ByteBuffer; import java.nio.ByteOrder; import java.util.Arrays; public class SAI288 { private static final int ROUNDS = 64; private static final int STATE_SIZE = 9; private static final int BLOCK_SIZE = 72; private static final int OUTPUT_SIZE = 36; private static final int[] IV = { 0x243F6A88, 0x85A308D3, 0x13198A2E, 0x03707344, 0xA4093822, 0x299F31D0, 0x082EFA98, 0xEC4E6C89, 0x452821E6 }; private int[] state = new int[STATE_SIZE]; private byte[] buffer = new byte[BLOCK_SIZE]; private byte[] midliner = new byte[BLOCK_SIZE]; private int bufferPos = 0; private long totalBytes = 0; public SAI288() { reset(); } public void reset() { System.arraycopy(IV, 0, state, 0, STATE_SIZE); Arrays.fill(buffer, (byte) 0); Arrays.fill(midliner, (byte) 0); bufferPos = 0; totalBytes = 0; } private void processMidliner(byte[] data) { for (int i = 0; i < data.length && i < BLOCK_SIZE; i++) { midliner[i] ^= data[i]; } } public void update(byte[] data) { update(data, 0, data.length); } public void update(byte[] data, int offset, int length) { processMidliner(Arrays.copyOfRange(data, offset, offset + Math.min(length, BLOCK_SIZE))); totalBytes += length; int remaining = length; int dataPos = offset; while (remaining > 0) { int toCopy = Math.min(remaining, BLOCK_SIZE - bufferPos); System.arraycopy(data, dataPos, buffer, bufferPos, toCopy); bufferPos += toCopy; dataPos += toCopy; remaining -= toCopy; if (bufferPos == BLOCK_SIZE) { processBlock(buffer); bufferPos = 0; } } } private void processBlock(byte[] block) { int[] m = new int[18]; ByteBuffer bb = ByteBuffer.wrap(block).order(ByteOrder.LITTLE_ENDIAN); for (int i = 0; i < 18 && bb.hasRemaining(); i++) { m[i] = bb.remaining() >= 4 ? bb.getInt() : 0; }   for (int round = 0; round < ROUNDS; round++) { for (int i = 0; i < STATE_SIZE; i++) { state[i] ^= m[i % 18]; state[i] = Integer.rotateLeft(state[i], (round + i) % 32); if (i > 0) { state[i] += state[i - 1]; } } for (int i = 0; i < 18; i++) { m[i] = Integer.rotateRight(m[i] ^ state[i % STATE_SIZE], 7); } } } public byte[] digest() { byte[] padded = new byte[BLOCK_SIZE]; System.arraycopy(buffer, 0, padded, 0, bufferPos); padded[bufferPos] = (byte) 0x80; ByteBuffer bb = ByteBuffer.wrap(padded, BLOCK_SIZE - 8, 8).order(ByteOrder.LITTLE_ENDIAN); bb.putLong(totalBytes * 8); processBlock(padded); processBlock(midliner); ByteBuffer output = ByteBuffer.allocate(OUTPUT_SIZE).order(ByteOrder.LITTLE_ENDIAN); for (int i = 0; i < STATE_SIZE; i++) { output.putInt(state[i]); } byte[] result = new byte[OUTPUT_SIZE]; output.flip(); output.get(result); reset(); return result; } public static byte[] hash(byte[] data) { SAI288 hasher = new SAI288(); hasher.update(data); return hasher.digest(); } public static native byte[] hashNative(byte[] data); } Or the latest SAI-288 Cryptography import java.nio.ByteBuffer; import java.nio.charset.StandardCharsets; public class SAI288 { private static final int[] IV = { 0x243F6A88, 0x85A308D3, 0x13198A2E, 0x03707344, 0xA4093822, 0x299F31D0, 0x082EFA98, 0xEC4E6C89, 0x452821E6 }; private static final byte[] شمائل = { (byte)0xD8, (byte)0xB4, (byte)0xD9, (byte)0x85, (byte)0xD8, (byte)0xA7, (byte)0xD8, (byte)0xA6, (byte)0xD9, (byte)0x84 };   public static byte[] hash(byte[] input) { int[] state = new int[9]; System.arraycopy(IV, 0, state, 0, 9); byte[] padded = pad(input); for (int i = 0; i < padded.length; i += 72) { byte[] block = new byte[72]; System.arraycopy(padded, i, block, 0, Math.min(72, padded.length - i)); processBlock(state, block); } return stateToBytes(state); } private static void processBlock(int[] state, byte[] block) { int[] M = new int[18]; ByteBuffer bb = ByteBuffer.wrap(block); for (int i = 0; i < 18 && bb.hasRemaining(); i++) { M[i] = bb.hasRemaining() ? bb.getInt() : 0; } for (int round = 0; round < 64; round++) { for (int i = 0; i < 9; i++) { state[i] ^= M[round % 18]; state[i] = Integer.rotateLeft(state[i], (round + i) % 32); state[i] ^= شمائل[i % شمائل.length]; } } } private static byte[] pad(byte[] input) { int blockSize = 72; int paddedLength = ((input.length + blockSize - 1) / blockSize) * blockSize; ; byte[] padded = new byte[paddedLength]; System.arraycopy(input, 0, padded, 0, input.length); padded[input.length] = (byte)0x80; return padded; } private static byte[] stateToBytes(int[] state) { ByteBuffer bb = ByteBuffer.allocate(36); for (int s : state) { bb.putInt(s); } return bb.array(); } } Or if with CAT EOF, cat > src/main/java/org/syamailcoin/crypto/sai288/SAI288.java << 'EOF' package org.syamailcoin.crypto.sai288; import java.nio.ByteBuffer; import java.nio.charset.StandardCharsets; public class SAI288 { private static final int[] IV = { 0x243F6A88, 0x85A308D3, 0x13198A2E, 0x03707344, 0xA4093822, 0x299F31D0, 0x082EFA98, 0xEC4E6C89, 0x452821E6 }; private static final byte[] شمائل = { (byte)0xD8, (byte)0xB4, (byte)0xD9, (byte)0x85, (byte)0xD8, (byte)0xA7, (byte)0xD8, (byte)0xA6, (byte)0xD9, (byte)0x84 }; public static byte[] hash(byte[] input) { int[] state = new int[9]; System.arraycopy(IV, 0, state, 0, 9); byte[] padded = pad(input); for (int i = 0; i < padded.length; i += 72) { byte[] block = new byte[72]; System.arraycopy(padded, i, block, 0, Math.min(72, padded.length - i)); processBlock(state, block); } return stateToBytes(state); } private static void processBlock(int[] state, byte[] block) { int[] M = new int[18]; ByteBuffer bb = ByteBuffer.wrap(block); for (int i = 0; i < 18 && bb.hasRemaining(); i++) { M[i] = bb.hasRemaining() ? bb.getInt() : 0; } for (int round = 0; round < 64; round++) { for (int i = 0; i < 9; i++) { state[i] ^= M[round % 18]; state[i] = Integer.rotateLeft(state[i], (round + i) % 32); state[i] ^= شمائل[i % شمائل.length]; } } } private static byte[] pad(byte[] input) { int blockSize = 72; int paddedLength = ((input.length + blockSize - 1) / blockSize) * blockSize; byte[] padded = new byte[paddedLength]; System.arraycopy(input, 0, padded, 0, input.length); padded[input.length] = (byte)0x80; return padded; } private static byte[] stateToBytes(int[] state) { ByteBuffer bb = ByteBuffer.allocate(36); for (int s : state) { bb.putInt(s); } return bb.array(); } } EOF At first the cryptography was designed for Syamailcoin which is the coin that I am creating, you can verify it first or see it in the X post on Alshen Feshiru's account. 9469999.9999999428 Max Supply and reward distribution using the Inevitability Stage i.e. we cannot get rewards beyond the limited number of Stages unless the current Stage has been completed, Read first about the abstract of Syamailcoin. Syamailcoin prevents natural falsehood—corruption from system limits. When bits flip, valid state becomes indistinguishable from corrupted state. Provide self-verification: state accumulation with exponomial growth and harmonic decay, 288-bit , factorial consensus, and balanced bit. System tolerates 14.47% Byzantine faults across four time-decreasing stages. Focusing on the main topic, I just want to propose to jointly produce a new Smartphone with the concept of Decentralization instead of Semi decentralized or Semi Central, this problem occurs only in the LITTLE ENDIAN section, what I only help is that SAI-288 Cryptography is implemented there but with the concept of BIG ENDIAN and ROTR, it is enough that it is completely That this latest smartphone will be safe but you need to verify or test my Cryptography because it is open. Volla Punks -> Any Cryptography is implemented and one of them is SAI-288 -> Customize it to your desired Programming language -> Modification of SAI-288 to BIG ENDIAN, ROTR -> Charging Speed is enough 21W = I hope that as much as possible the initial selling price is not too expensive so that I can order this even though we are different countries, I fully support this as it should be. -----BEGIN PGP PUBLIC KEY BLOCK----- Comment: User ID: Alshen Feshiru < mailto:alshenfeshiru@zohomail.com > Comment: Valid from: 06/10/2025 09:35 Comment: Valid until: 02/04/2033 12:00 Comment: Type: 448-bit EdDSA (secret key available) Comment: Usage: Signing, Encryption, Certifying User IDs Comment: Fingerprint: 5871D671C35C12147308395A464505DE1047DA134C01C8EBF8D18D6B8CBD7763 mEkFaOMrBhYAAAA/AytlcQHHbHV7SgCdlZnHrIjtxAfcYYzs9R5GGNK46dlgzFzR B+1X8BPoMimXLemj9yoBK+lfLO7OaTZ9klqAtCtBbHNoZW4gRmVzaGlydSA8YWxz aGVuZmVzaGlydUB6b2hvbWFpbC5jb20+iM0FExYKAE0iIQVYcdZxw1wSFHMIOVpG RQXeEEfaE0wByOv40Y1rjL13YwUCaOMrBgIbAwUJDhXYSgULCQgHAgIiAgYVCgkI CwIEFgIDAQIeBwIXgAAApU0Bx3DEN60mahYzDrGcFnvmZ/5UaBBQTnLoSfPwG8Hz fYt/pLE+S/yMOrbDdUrg6LG0t33bh7Pu4BxjAAHGIAca1udLBqQZ6mYwpBI6Z2S0 XVIx+glBORH6ynYgZGBZOTBarTts7UctN7D0pbBE+J4Y7w9ooDEAuEwFaOMrBhIA AABCAytlbwG/civ41G/UgMeMBiRTScXvU83nUgSPz4fma7iCz5ZVfUUP9wBuxVxd n7gODEf7mnjE8Vt8XHgOZ6kDAQoJiLIFGBYKADIiIQVYcdZxw1wSFHMIOVpGRQXe EEfaE0wByOv40Y1rjL13YwUCaOMrBgIbDAUJDhXYSgAAzGAByPZFSr2g/J57qB4r 3ISgR4+mn83R9+R2TZL7s1qnDsqjw+t6B/b28dwlVxSXgXJtAcbW2hDlzORJAAHG O8MVhPLaPra69/XvhuhZW9vOw4YXydY9aW+63KiNA6iIeZz9HczEOvT6vdWjIj8f aQN2OLDD/yUA =Gs+D -----END PGP PUBLIC KEY BLOCK----- Warm Regards, Alshen Feshiru <SYAMAILCOIN_2025-10-05_223651.pdf> Volla Systeme GmbH General Manager Dr. Jörg Wurzer Kölner Straße 102 42897 Remscheid Germany Phone +49 2191 59897 62 Email mailto:info@volla.systems Homepage volla.online Commercial register HRB 28033 B VAT number DE311418133

1 0

Reverse proof of this
by Alshen Feshiru 24 Nov '25

24 Nov '25

Dear Capcom, I have indeed liked the product or even the game you created since childhood, it makes me nostalgic, maybe this is not the right message if it is sent to you, I just finished a Coin Which may have just been realized between 65-70% and you or anyone else can help me by logging into the server, I'm also actually starting to be interested in buying Capcom shares but maybe since I play more in the Crypto Market, maybe I can help Capcom create a Coin. But if you or the team from Capcom can help me to continue the process of Syamailcoin with the help of Funds, There are things I can do with no money and there are things I can do with money. I actually need $90k with the following calculations: $47k for Syamailcoin needs like buy physical tools of cryptography, Quside etc -> $29k to recruit and pay 10 Programmers (I have allocated it to be evenly distributed) -> $14k is for me personally = It's enough with $90k this month and next month, but it doesn't rule out the possibility, if there is a profit from other markets or even the Syamailcoin market, I will invest the profits into Capcom shares or if Capcom plans to create a coin. If you are interested in helping me complete the Syamailcoin process, any Node has no control or access to the genesis balance, even though I am the Founder of Syamailcoin but I would completely prefer to be a Syamailcoin Investor. The way the reward is distributed is with the Inevitability Stage, we cannot get a reward beyond the limited number of Stages unless the current Stage has been completed. (I have a good reason to need funds, or if you want to acquire these, you are very welcome, please keep an identity in the financial world like Syamailcoin and Bitcoin). Additional Notes: If Capcom is planning to create a coin, I can help but maybe only from the elaboration of Cryptography Mathematics and mathematical placement so that there are no logical reasoning errors in the code that has been run, enough? I contacted you not because I needed instant funds but because I was interested in Capcom or its shares and I see positively that you might be interested in Syamailcoin.

1 0

[Web4] A PDE-Based, Ledgerless Digital Currency System
by nouun 24 Nov '25

24 Nov '25

Hi all, I would like to share a new protocol proposal called Web4, a fully ledgerless, consensus-free digital currency model based on Laplacian dynamics and local imbalance (Δ)-based state updates. The system removes: - global history - global consensus - blockchains - timestamps - issuance - transaction records Instead, value is modeled as an instantaneous solution to a PDE-like equilibrium (Lx = 0), where nodes maintain only local imbalances. The security model includes a proof of: - double-spend impossibility (reductio) - information-theoretic anonymity (MI = 0) - trace impossibility under any observer - replay-impossibility due to Δ-conservation (ΣΔ = 0) Full paper (PDF): IPFS: https://ipfs.io/ipfs/QmUgh9cwfKM29Ziv2gfyPLZwC8vmBbibVB1rjcXhKqoCRq (Duplicate: https://ipfs.io/ipfs/bafkreifjbr6bufuwynktlhh4qkxoa2wswvoaa5jmkro3fa7oarufn…) Tor mirror: http://5ynukd6nbidflxbigvw4wuqgfug7cqoda5oi53udmrjxcmb5ltagmgid.onion GitHub: github.com/munonun/Web4 Possibly relevant to those interested in: cryptography, distributed systems, PDE-based computation, privacy, information theory, and ledgerless monetary models. Feedback, analysis or criticism is welcome. I may respond slowly due to time constraints. Best, KIM BYEONGYEON

2 2

Syamailcoin
by Alshen Feshiru 24 Nov '25

24 Nov '25

Syamailcoin has been realized around 65-70% and anyone who wants to help can enter the server to design or execute some other code, any Node does not have access to the genesis balance, 9469999.9999999428 Max Supply and reward distribution using the Inevitability Stage i.e. we cannot get a reward beyond the limited number of Stages unless the current Stage has been completed.

1 0

Re: Volla Punks
by Alshen Feshiru 23 Nov '25

23 Nov '25

Last but not least, what i need is to Manufacture a new Smartphone, and if I want to get this Volla Punks Smartphone to pack to my country, Will it still be necessary to pay? I will give you the full address and you can coordinate with the local authorities or through Multiple cross-package systems. In Indonesian: Jl. Kapten Samadikun 1 No. 04 RT. 01 Rw. 11, Kecamatan Kejaksan, Kelurahan Kesenden, 45121. (For The location of the address is after Dzaki Fried Chicken) It can be found on google maps, the address exists or can be found after passing through a downhill road to enter the Dit Polairud area, Then do not enter the gate area, after Dzaki Fried Chicken you will find an alley on the right turn, on the first left house that has a fence house and contact alshenfeshiru(a)zohomail.com. I'm just worried that if I have to keep paying to get Volla Punks, I'm afraid that it won't adjust to my financial condition, but the possibility of taxes from Indonesia or called BEA CUKAI, I asked again because there might be an ambiguous response, I repeated my question: If this new Smartphone is finished in production and I want the order to be sent to the State of Indonesia, do I need to pay or for free? Or if I pay can I get a discount?. The one who pays Bea Cukai is the Package Recipient, if or even if the package is sent free of charge to me but the tax in Indonesia still has to be paid by the package recipient. Maybe the Indonesian courier who sent the package to the destination address, or whoever would get to the destination address right on a picture of the house I gave (Not an orange house) probably won't meet me, but there will be someone else who receives the package. If I talk realistically financially or financially, I can afford to pay Bea Cukai (Tax) but if the price of the Volla Punks Smartphone exceeds the current financial condition, I will most likely have to wait and if the Volla Punks sales stock runs out and is no longer produced, then it is likely that I will never get the Volla Punks. This doesn't mean that I ask for free, It's just that if you agree to send it for free, I can help market Volla Punks or Volla so that the Indonesian people are interested in this new product in their market share. ---- On Sun, 23 Nov 2025 19:57:48 +0900 info(a)volla.online wrote ---- Dear Mr Feshiru, Thanks for your reply. Can you mention some requirements or a form for me to fill out? For a quote with our general terms and conditions I just need your contact details, that can later be used for you order, contract and invoicing. More important are your requirements: - In which device models are you interested? - Do you want the devices with one of our official operating system or do you want a customized operating system? - Do you want custom packaging? in terms of the market, now like the State of Indonesia is almost starting to adopt the nature of Decentralization starting from Finance, Identity etc of some who understand Renewable Technology etc, If indeed your team is ready to collaborate or produce this new Smartphone, maybe I will order from Indonesia but most likely you will not meet my physical body, you can give the Smartphone package to a trusted person or I coordinate either geolocation or location is completely accurate. To speak like this I will continue to use VPNs in maintaining Identity or Sensitivity between Geographical encounters. We needn’t meet us in person. We just need a valid contact to a legal entity with residential address for a valid contract and fulfilling your order practically. There is a high possibility that asking for government permission in Indonesia will be difficult, but many people actually agree with this, think of the slim design or body of a smartphone because of the genetics of Indonesians in general, especially their fists are not so big as Europeans, Volla's company's monetization rate will be profitable if marketed here. All our devices are CE certified, the Volla Phone Quintus is FCC certified. If you need a local certification we can help you to get the required certification. We could invoice the costs or agree on a minimum order quantity so we are able to cover the costs. Shipping a few devices to Indonesia is no problem. Only if you start officially sales in Indonesia, the devices should be compliant to the national law and regulations. Maybe from me it is enough to convey this message, if I want to get a Smartphone or Volla Punks, do I still have to pay like other consumers? Sure. Please check the world perk at http://quintus.volla.online oder http://tablet.volla.online . Let me know if you don’t find your shipping destination. We will update the perk then. You can ask technical questions such as "What is the Math Description for a digital signature?" "What libraries will be used as Objects or installed from Linux Servers?" "The most relevant port?" and some other technical questions that I can still handle, if it is possible to create a separate port aka Custom it is not a problem but it would be better to use a Bitcoin port, 8333. To prevent Bit Flip from a system on your Smartphone, you can integrate NOT as you can read in the Syamailcoin Whitepaper about Bit Flip or Bit Problem, the hardware you use should not be damaged or radiation effects or even corrupt, if there is one of them then it is not completely Decentralized, to prove a Smartphone Decentralization is to be proven in reverse. I’m not sure, what you want to say. Do you want to have a specific wallet on the device? Enjoy the day! Best regards Dr. Jörg Wurzer Volla Systeme GmbH General Manager Dr. Jörg Wurzer Kölner Straße 102 42897 Remscheid Germany Phone +49 2191 59897 61 Email mailto:info@volla.systems Homepage volla.online Commercial register HRB 28033 B VAT number DE311418133

1 0

Re: Volla Punks
by Alshen Feshiru 23 Nov '25

23 Nov '25

In summary, what I need is a new Smartphone with Custom Volla OS and some Cryptography components as well as the Chipset that I provided earlier, as an additional note separate this Volla Punks Resource from other Resources within a Server, or if you have the ability to create a Server inside a server or Layer-2 it would be better because maybe this will make you know better. If executing in your linux server or your own volla server in Custom or something like that, don't interfere with the previous usage consumption, if you mix this new file with private files or even mix it, I'm afraid that something undesirable will happen, Maybe that's all I can give you at the moment, if you have any critical questions, please reply or ask again. Then to Direct Current and Alternating Current, we can create so that electricity is forever maintained or scattered in the Oscillator moving upwards, this will prevent the entire attacker, First of all, take it from the battery power source -> Turn it into an AC or AC oscillation signal -> Raise the signal with 'Biasing' and the AC voltage must be provided positive DC bias as Baseline -> Your last Need to Distribute Oscillation through RF pathways = It will find an antenna that if the composition of this electricity is mainly in terms of telecommunications that I may read a little about references or history like Nikola Tesla. ---- On Sun, 23 Nov 2025 20:03:49 +0900 mailto:info@volla.online wrote ---- Hello again We can offer our existing devices or upcoming ones. What are you requirements to a smartphone? I assume you want to have a custom operating system with your own encryption features? Volla OS for sure already uses several encryption and signing technologies to protect the integrity of the system and user’s data. Do you want to sell your own devices with your own brand? Or would you like to be come a reseller? Or are you interested to contribute to the evolution of Volla OS as a community developer? Did you already develop your own Android or mobile Linux fork? With best regards Dr. Jörg Wurzer Am 23.11.2025 um 03:58 schrieb Alshen Feshiru < mailto:alshenfeshiru@zohomail.com >: The name Alshen Feshiru is honestly just a Pseudonym and I am not tied to a Company or anything Centralized, but I can or can help to be marketed not only in Europe but also Southeast Asia. If it is true that you agree to the proposal about this Cryptography collaboration for such as Producing a new Smartphone, if it is necessary to input Data or Forms, What should I fill out? because maybe your team can only log in or execute coding from the Server or Software Volla, whereas I may not be allowed, please note again that I will only help or give a map of Cryptography and Lithography, not all of them have to be Custom, sometimes the Standard is much better because it has been tested for dozens, decades. Best Regards, Alshen Feshiru ---- On Sat, 22 Nov 2025 23:37:27 +0900 mailto:info@volla.online wrote ---- Dwar Mr Feshiru, Thanks for your message and interest in our products. Not only do our smartphones and tablets seem to be a perfect fit for your needs, but so do our Volla Cloud with distributed data processing and storage, as well as our research into the Volla Meshnet as a distributed infrastructure for data transmission. As a retailer, you are welcome to sell our products with accessories. We also offer business customers the option of customizing the operating system and dual branding. With a planned smartphone, we could also offer your logo exclusively on the back of the device. Business customers can also flash our devices themselves. One of our customers is doing so. Let me know if are interested in a quote. If so, we would need the contact data of your company. With best regards Dr. Jörg Wurzer Actually I am interested in a product called Volla Phone Quintus and a coincidence I am the youngest former Cryptographer, Alshen Feshiru is just a Pseudonym name, but actually I am creating Software for anyone will get complete privacy, IP Location will be Pseudonymous and some intended Devices will get the Internet that no longer requires a centralized provider, As long as the electricity is scattered in the Oscillator moving upwards called Upward, it will defeat all attackers. Or it is possible for us to produce a new Smartphone from Volla, For example, with the name Volla Punks , you can also contact me this email or have a further conversation on the Cypherpunks mailing list, I am used to and almost always have conversations there if needed such as Cryptography consultations, Lithography and everything related to Decentralized privacy. I only help the Cryptography part either in mathematical calculations or modifications that are completely Decentralized, Anti-Bias Optoelectronics and coding decisions or something like that can be decided by your Production Team, I just give a map, I have a standalone Cryptography which is SAI-288 with Multi Languages, Anyone can Implement this with the JAVA Main Language but the other languages are C++ and Rust and Python and Swift, You can modify other Multi Languages to suit your needs but it would be better, the control is not on the Team or Vendor, import java.nio.ByteBuffer; import java.nio.ByteOrder; import java.util.Arrays; public class SAI288 { private static final int ROUNDS = 64; private static final int STATE_SIZE = 9; private static final int BLOCK_SIZE = 72; private static final int OUTPUT_SIZE = 36; private static final int[] IV = { 0x243F6A88, 0x85A308D3, 0x13198A2E, 0x03707344, 0xA4093822, 0x299F31D0, 0x082EFA98, 0xEC4E6C89, 0x452821E6 }; private int[] state = new int[STATE_SIZE]; private byte[] buffer = new byte[BLOCK_SIZE]; private byte[] midliner = new byte[BLOCK_SIZE]; private int bufferPos = 0; private long totalBytes = 0; public SAI288() { reset(); } public void reset() { System.arraycopy(IV, 0, state, 0, STATE_SIZE); Arrays.fill(buffer, (byte) 0); Arrays.fill(midliner, (byte) 0); bufferPos = 0; totalBytes = 0; } private void processMidliner(byte[] data) { for (int i = 0; i < data.length && i < BLOCK_SIZE; i++) { midliner[i] ^= data[i]; } } public void update(byte[] data) { update(data, 0, data.length); } public void update(byte[] data, int offset, int length) { processMidliner(Arrays.copyOfRange(data, offset, offset + Math.min(length, BLOCK_SIZE))); totalBytes += length; int remaining = length; int dataPos = offset; while (remaining > 0) { int toCopy = Math.min(remaining, BLOCK_SIZE - bufferPos); System.arraycopy(data, dataPos, buffer, bufferPos, toCopy); bufferPos += toCopy; dataPos += toCopy; remaining -= toCopy; if (bufferPos == BLOCK_SIZE) { processBlock(buffer); bufferPos = 0; } } } private void processBlock(byte[] block) { int[] m = new int[18]; ByteBuffer bb = ByteBuffer.wrap(block).order(ByteOrder.LITTLE_ENDIAN); for (int i = 0; i < 18 && bb.hasRemaining(); i++) { m[i] = bb.remaining() >= 4 ? bb.getInt() : 0; } for (int round = 0; round < ROUNDS; round++) { for (int i = 0; i < STATE_SIZE; i++) { state[i] ^= m[i % 18]; state[i] = Integer.rotateLeft(state[i], (round + i) % 32); if (i > 0) { state[i] += state[i - 1]; } } for (int i = 0; i < 18; i++) { m[i] = Integer.rotateRight(m[i] ^ state[i % STATE_SIZE], 7); } } } public byte[] digest() { byte[] padded = new byte[BLOCK_SIZE]; System.arraycopy(buffer, 0, padded, 0, bufferPos); padded[bufferPos] = (byte) 0x80; ByteBuffer bb = ByteBuffer.wrap(padded, BLOCK_SIZE - 8, 8).order(ByteOrder.LITTLE_ENDIAN); bb.putLong(totalBytes * 8); processBlock(padded); processBlock(midliner); ByteBuffer output = ByteBuffer.allocate(OUTPUT_SIZE).order(ByteOrder.LITTLE_ENDIAN); for (int i = 0; i < STATE_SIZE; i++) { output.putInt(state[i]); } byte[] result = new byte[OUTPUT_SIZE]; output.flip(); output.get(result); reset(); return result; } public static byte[] hash(byte[] data) { SAI288 hasher = new SAI288(); hasher.update(data); return hasher.digest(); } public static native byte[] hashNative(byte[] data); } Or the latest SAI-288 Cryptography import java.nio.ByteBuffer; import java.nio.charset.StandardCharsets; public class SAI288 { private static final int[] IV = { 0x243F6A88, 0x85A308D3, 0x13198A2E, 0x03707344, 0xA4093822, 0x299F31D0, 0x082EFA98, 0xEC4E6C89, 0x452821E6 }; private static final byte[] شمائل = { (byte)0xD8, (byte)0xB4, (byte)0xD9, (byte)0x85, (byte)0xD8, (byte)0xA7, (byte)0xD8, (byte)0xA6, (byte)0xD9, (byte)0x84 };   public static byte[] hash(byte[] input) { int[] state = new int[9]; System.arraycopy(IV, 0, state, 0, 9); byte[] padded = pad(input); for (int i = 0; i < padded.length; i += 72) { byte[] block = new byte[72]; System.arraycopy(padded, i, block, 0, Math.min(72, padded.length - i)); processBlock(state, block); } return stateToBytes(state); } private static void processBlock(int[] state, byte[] block) { int[] M = new int[18]; ByteBuffer bb = ByteBuffer.wrap(block); for (int i = 0; i < 18 && bb.hasRemaining(); i++) { M[i] = bb.hasRemaining() ? bb.getInt() : 0; } for (int round = 0; round < 64; round++) { for (int i = 0; i < 9; i++) { state[i] ^= M[round % 18]; state[i] = Integer.rotateLeft(state[i], (round + i) % 32); state[i] ^= شمائل[i % شمائل.length]; } } } private static byte[] pad(byte[] input) { int blockSize = 72; int paddedLength = ((input.length + blockSize - 1) / blockSize) * blockSize; ; byte[] padded = new byte[paddedLength]; System.arraycopy(input, 0, padded, 0, input.length); padded[input.length] = (byte)0x80; return padded; } private static byte[] stateToBytes(int[] state) { ByteBuffer bb = ByteBuffer.allocate(36); for (int s : state) { bb.putInt(s); } return bb.array(); } } Or if with CAT EOF, cat > src/main/java/org/syamailcoin/crypto/sai288/SAI288.java << 'EOF' package org.syamailcoin.crypto.sai288; import java.nio.ByteBuffer; import java.nio.charset.StandardCharsets; public class SAI288 { private static final int[] IV = { 0x243F6A88, 0x85A308D3, 0x13198A2E, 0x03707344, 0xA4093822, 0x299F31D0, 0x082EFA98, 0xEC4E6C89, 0x452821E6 }; private static final byte[] شمائل = { (byte)0xD8, (byte)0xB4, (byte)0xD9, (byte)0x85, (byte)0xD8, (byte)0xA7, (byte)0xD8, (byte)0xA6, (byte)0xD9, (byte)0x84 }; public static byte[] hash(byte[] input) { int[] state = new int[9]; System.arraycopy(IV, 0, state, 0, 9); byte[] padded = pad(input); for (int i = 0; i < padded.length; i += 72) { byte[] block = new byte[72]; System.arraycopy(padded, i, block, 0, Math.min(72, padded.length - i)); processBlock(state, block); } return stateToBytes(state); } private static void processBlock(int[] state, byte[] block) { int[] M = new int[18]; ByteBuffer bb = ByteBuffer.wrap(block); for (int i = 0; i < 18 && bb.hasRemaining(); i++) { M[i] = bb.hasRemaining() ? bb.getInt() : 0; } for (int round = 0; round < 64; round++) { for (int i = 0; i < 9; i++) { state[i] ^= M[round % 18]; state[i] = Integer.rotateLeft(state[i], (round + i) % 32); state[i] ^= شمائل[i % شمائل.length]; } } } private static byte[] pad(byte[] input) { int blockSize = 72; int paddedLength = ((input.length + blockSize - 1) / blockSize) * blockSize; byte[] padded = new byte[paddedLength]; System.arraycopy(input, 0, padded, 0, input.length); padded[input.length] = (byte)0x80; return padded; } private static byte[] stateToBytes(int[] state) { ByteBuffer bb = ByteBuffer.allocate(36); for (int s : state) { bb.putInt(s); } return bb.array(); } } EOF At first the cryptography was designed for Syamailcoin which is the coin that I am creating, you can verify it first or see it in the X post on Alshen Feshiru's account. 9469999.9999999428 Max Supply and reward distribution using the Inevitability Stage i.e. we cannot get rewards beyond the limited number of Stages unless the current Stage has been completed, Read first about the abstract of Syamailcoin. Syamailcoin prevents natural falsehood—corruption from system limits. When bits flip, valid state becomes indistinguishable from corrupted state. Provide self-verification: state accumulation with exponomial growth and harmonic decay, 288-bit , factorial consensus, and balanced bit. System tolerates 14.47% Byzantine faults across four time-decreasing stages. Focusing on the main topic, I just want to propose to jointly produce a new Smartphone with the concept of Decentralization instead of Semi decentralized or Semi Central, this problem occurs only in the LITTLE ENDIAN section, what I only help is that SAI-288 Cryptography is implemented there but with the concept of BIG ENDIAN and ROTR, it is enough that it is completely That this latest smartphone will be safe but you need to verify or test my Cryptography because it is open. Volla Punks -> Any Cryptography is implemented and one of them is SAI-288 -> Customize it to your desired Programming language -> Modification of SAI-288 to BIG ENDIAN, ROTR -> Charging Speed is enough 21W = I hope that as much as possible the initial selling price is not too expensive so that I can order this even though we are different countries, I fully support this as it should be. -----BEGIN PGP PUBLIC KEY BLOCK----- Comment: User ID: Alshen Feshiru < mailto:alshenfeshiru@zohomail.com > Comment: Valid from: 06/10/2025 09:35 Comment: Valid until: 02/04/2033 12:00 Comment: Type: 448-bit EdDSA (secret key available) Comment: Usage: Signing, Encryption, Certifying User IDs Comment: Fingerprint: 5871D671C35C12147308395A464505DE1047DA134C01C8EBF8D18D6B8CBD7763 mEkFaOMrBhYAAAA/AytlcQHHbHV7SgCdlZnHrIjtxAfcYYzs9R5GGNK46dlgzFzR B+1X8BPoMimXLemj9yoBK+lfLO7OaTZ9klqAtCtBbHNoZW4gRmVzaGlydSA8YWxz aGVuZmVzaGlydUB6b2hvbWFpbC5jb20+iM0FExYKAE0iIQVYcdZxw1wSFHMIOVpG RQXeEEfaE0wByOv40Y1rjL13YwUCaOMrBgIbAwUJDhXYSgULCQgHAgIiAgYVCgkI CwIEFgIDAQIeBwIXgAAApU0Bx3DEN60mahYzDrGcFnvmZ/5UaBBQTnLoSfPwG8Hz fYt/pLE+S/yMOrbDdUrg6LG0t33bh7Pu4BxjAAHGIAca1udLBqQZ6mYwpBI6Z2S0 XVIx+glBORH6ynYgZGBZOTBarTts7UctN7D0pbBE+J4Y7w9ooDEAuEwFaOMrBhIA AABCAytlbwG/civ41G/UgMeMBiRTScXvU83nUgSPz4fma7iCz5ZVfUUP9wBuxVxd n7gODEf7mnjE8Vt8XHgOZ6kDAQoJiLIFGBYKADIiIQVYcdZxw1wSFHMIOVpGRQXe EEfaE0wByOv40Y1rjL13YwUCaOMrBgIbDAUJDhXYSgAAzGAByPZFSr2g/J57qB4r 3ISgR4+mn83R9+R2TZL7s1qnDsqjw+t6B/b28dwlVxSXgXJtAcbW2hDlzORJAAHG O8MVhPLaPra69/XvhuhZW9vOw4YXydY9aW+63KiNA6iIeZz9HczEOvT6vdWjIj8f aQN2OLDD/yUA =Gs+D -----END PGP PUBLIC KEY BLOCK----- Warm Regards, Alshen Feshiru <SYAMAILCOIN_2025-10-05_223651.pdf> Volla Systeme GmbH General Manager Dr. Jörg Wurzer Kölner Straße 102 42897 Remscheid Germany Phone +49 2191 59897 62 Email mailto:info@volla.systems Homepage volla.online Commercial register HRB 28033 B VAT number DE311418133

1 0

Re: Volla Punks
by Alshen Feshiru 23 Nov '25

23 Nov '25

I'm going to break down what I really need right now, The answer is to Produce a new Smartphone called Volla Punks or Alshen Punks (If allowed) I can't handle all of them, but as much as I can, I can give code or technical instructions from Cryptography and Lithography in a concrete way. Don't Trust; Verify. With Custom Volla OS -> Hashing will prioritize SAI-288 and therefore Multi Languages on Java, C++, RUST, Swift, Python which makes it easier for your Programmers to process these Programming Languages -> Modified the SAI-288 to focus on BIG ENDIAN and ROTR where you can read references from https://github.com/MiCode/Xiaomi_Kernel_OpenSource/issues/40399 -> Exact 2 numbers before 288 then Simplify Exponential From the first definition onwards then this will create an identity input or this becomes a recommendation for identity input -> Cryptography for the security of a network can implement Narrowband IOT with Cat-NB2 standard and for digital signatures it is better to choose Dilitihium2 which you can get from the Open Quantum Safe library or anywhere else except Bouncycastle -> For the Lithography or SoC part, I should choose the Snapdragon 870 5G because I have never created a Chipset on my own unless you want to help -> If possible, to implement a Custom Chipset e.g. with a name Midcells 777 with 3nm (If possible) that is, not only from one person's idea, my idea is limited to this, my idea about Custom Chipset is that Boolean must be precise first before ENDIAN reaches the target -> Charging speed should be enough 21W = That's all I can give, but if you have a technical question about Cryptography or Soc Lithography or if you want to ask questions like "Where should I place the definition of Cryptography Mathematics A?" SAI-288 cryptography anyone can import even the programmers on your team can execute in front of their computers. ---- On Sun, 23 Nov 2025 20:03:49 +0900 info(a)volla.online wrote ---- Hello again We can offer our existing devices or upcoming ones. What are you requirements to a smartphone? I assume you want to have a custom operating system with your own encryption features? Volla OS for sure already uses several encryption and signing technologies to protect the integrity of the system and user’s data. Do you want to sell your own devices with your own brand? Or would you like to be come a reseller? Or are you interested to contribute to the evolution of Volla OS as a community developer? Did you already develop your own Android or mobile Linux fork? With best regards Dr. Jörg Wurzer Am 23.11.2025 um 03:58 schrieb Alshen Feshiru < mailto:alshenfeshiru@zohomail.com >: The name Alshen Feshiru is honestly just a Pseudonym and I am not tied to a Company or anything Centralized, but I can or can help to be marketed not only in Europe but also Southeast Asia. If it is true that you agree to the proposal about this Cryptography collaboration for such as Producing a new Smartphone, if it is necessary to input Data or Forms, What should I fill out? because maybe your team can only log in or execute coding from the Server or Software Volla, whereas I may not be allowed, please note again that I will only help or give a map of Cryptography and Lithography, not all of them have to be Custom, sometimes the Standard is much better because it has been tested for dozens, decades. Best Regards, Alshen Feshiru ---- On Sat, 22 Nov 2025 23:37:27 +0900 mailto:info@volla.online wrote ---- Dwar Mr Feshiru, Thanks for your message and interest in our products. Not only do our smartphones and tablets seem to be a perfect fit for your needs, but so do our Volla Cloud with distributed data processing and storage, as well as our research into the Volla Meshnet as a distributed infrastructure for data transmission. As a retailer, you are welcome to sell our products with accessories. We also offer business customers the option of customizing the operating system and dual branding. With a planned smartphone, we could also offer your logo exclusively on the back of the device. Business customers can also flash our devices themselves. One of our customers is doing so. Let me know if are interested in a quote. If so, we would need the contact data of your company. With best regards Dr. Jörg Wurzer Actually I am interested in a product called Volla Phone Quintus and a coincidence I am the youngest former Cryptographer, Alshen Feshiru is just a Pseudonym name, but actually I am creating Software for anyone will get complete privacy, IP Location will be Pseudonymous and some intended Devices will get the Internet that no longer requires a centralized provider, As long as the electricity is scattered in the Oscillator moving upwards called Upward, it will defeat all attackers. Or it is possible for us to produce a new Smartphone from Volla, For example, with the name Volla Punks , you can also contact me this email or have a further conversation on the Cypherpunks mailing list, I am used to and almost always have conversations there if needed such as Cryptography consultations, Lithography and everything related to Decentralized privacy. I only help the Cryptography part either in mathematical calculations or modifications that are completely Decentralized, Anti-Bias Optoelectronics and coding decisions or something like that can be decided by your Production Team, I just give a map, I have a standalone Cryptography which is SAI-288 with Multi Languages, Anyone can Implement this with the JAVA Main Language but the other languages are C++ and Rust and Python and Swift, You can modify other Multi Languages to suit your needs but it would be better, the control is not on the Team or Vendor, import java.nio.ByteBuffer; import java.nio.ByteOrder; import java.util.Arrays; public class SAI288 { private static final int ROUNDS = 64; private static final int STATE_SIZE = 9; private static final int BLOCK_SIZE = 72; private static final int OUTPUT_SIZE = 36; private static final int[] IV = { 0x243F6A88, 0x85A308D3, 0x13198A2E, 0x03707344, 0xA4093822, 0x299F31D0, 0x082EFA98, 0xEC4E6C89, 0x452821E6 }; private int[] state = new int[STATE_SIZE]; private byte[] buffer = new byte[BLOCK_SIZE]; private byte[] midliner = new byte[BLOCK_SIZE]; private int bufferPos = 0; private long totalBytes = 0; public SAI288() { reset(); } public void reset() { System.arraycopy(IV, 0, state, 0, STATE_SIZE); Arrays.fill(buffer, (byte) 0); Arrays.fill(midliner, (byte) 0); bufferPos = 0; totalBytes = 0; } private void processMidliner(byte[] data) { for (int i = 0; i < data.length && i < BLOCK_SIZE; i++) { midliner[i] ^= data[i]; } } public void update(byte[] data) { update(data, 0, data.length); } public void update(byte[] data, int offset, int length) { processMidliner(Arrays.copyOfRange(data, offset, offset + Math.min(length, BLOCK_SIZE))); totalBytes += length; int remaining = length; int dataPos = offset; while (remaining > 0) { int toCopy = Math.min(remaining, BLOCK_SIZE - bufferPos); System.arraycopy(data, dataPos, buffer, bufferPos, toCopy); bufferPos += toCopy; dataPos += toCopy; remaining -= toCopy; if (bufferPos == BLOCK_SIZE) { processBlock(buffer); bufferPos = 0; } } } private void processBlock(byte[] block) { int[] m = new int[18]; ByteBuffer bb = ByteBuffer.wrap(block).order(ByteOrder.LITTLE_ENDIAN); for (int i = 0; i < 18 && bb.hasRemaining(); i++) { m[i] = bb.remaining() >= 4 ? bb.getInt() : 0; } for (int round = 0; round < ROUNDS; round++) { for (int i = 0; i < STATE_SIZE; i++) { state[i] ^= m[i % 18]; state[i] = Integer.rotateLeft(state[i], (round + i) % 32); if (i > 0) { state[i] += state[i - 1]; } } for (int i = 0; i < 18; i++) { m[i] = Integer.rotateRight(m[i] ^ state[i % STATE_SIZE], 7); } } } public byte[] digest() { byte[] padded = new byte[BLOCK_SIZE]; System.arraycopy(buffer, 0, padded, 0, bufferPos); padded[bufferPos] = (byte) 0x80; ByteBuffer bb = ByteBuffer.wrap(padded, BLOCK_SIZE - 8, 8).order(ByteOrder.LITTLE_ENDIAN); bb.putLong(totalBytes * 8); processBlock(padded); processBlock(midliner); ByteBuffer output = ByteBuffer.allocate(OUTPUT_SIZE).order(ByteOrder.LITTLE_ENDIAN); for (int i = 0; i < STATE_SIZE; i++) { output.putInt(state[i]); } byte[] result = new byte[OUTPUT_SIZE]; output.flip(); output.get(result); reset(); return result; } public static byte[] hash(byte[] data) { SAI288 hasher = new SAI288(); hasher.update(data); return hasher.digest(); } public static native byte[] hashNative(byte[] data); } Or the latest SAI-288 Cryptography import java.nio.ByteBuffer; import java.nio.charset.StandardCharsets; public class SAI288 { private static final int[] IV = { 0x243F6A88, 0x85A308D3, 0x13198A2E, 0x03707344, 0xA4093822, 0x299F31D0, 0x082EFA98, 0xEC4E6C89, 0x452821E6 }; private static final byte[] شمائل = { (byte)0xD8, (byte)0xB4, (byte)0xD9, (byte)0x85, (byte)0xD8, (byte)0xA7, (byte)0xD8, (byte)0xA6, (byte)0xD9, (byte)0x84 };   public static byte[] hash(byte[] input) { int[] state = new int[9]; System.arraycopy(IV, 0, state, 0, 9); byte[] padded = pad(input); for (int i = 0; i < padded.length; i += 72) { byte[] block = new byte[72]; System.arraycopy(padded, i, block, 0, Math.min(72, padded.length - i)); processBlock(state, block); } return stateToBytes(state); } private static void processBlock(int[] state, byte[] block) { int[] M = new int[18]; ByteBuffer bb = ByteBuffer.wrap(block); for (int i = 0; i < 18 && bb.hasRemaining(); i++) { M[i] = bb.hasRemaining() ? bb.getInt() : 0; } for (int round = 0; round < 64; round++) { for (int i = 0; i < 9; i++) { state[i] ^= M[round % 18]; state[i] = Integer.rotateLeft(state[i], (round + i) % 32); state[i] ^= شمائل[i % شمائل.length]; } } } private static byte[] pad(byte[] input) { int blockSize = 72; int paddedLength = ((input.length + blockSize - 1) / blockSize) * blockSize; ; byte[] padded = new byte[paddedLength]; System.arraycopy(input, 0, padded, 0, input.length); padded[input.length] = (byte)0x80; return padded; } private static byte[] stateToBytes(int[] state) { ByteBuffer bb = ByteBuffer.allocate(36); for (int s : state) { bb.putInt(s); } return bb.array(); } } Or if with CAT EOF, cat > src/main/java/org/syamailcoin/crypto/sai288/SAI288.java << 'EOF' package org.syamailcoin.crypto.sai288; import java.nio.ByteBuffer; import java.nio.charset.StandardCharsets; public class SAI288 { private static final int[] IV = { 0x243F6A88, 0x85A308D3, 0x13198A2E, 0x03707344, 0xA4093822, 0x299F31D0, 0x082EFA98, 0xEC4E6C89, 0x452821E6 }; private static final byte[] شمائل = { (byte)0xD8, (byte)0xB4, (byte)0xD9, (byte)0x85, (byte)0xD8, (byte)0xA7, (byte)0xD8, (byte)0xA6, (byte)0xD9, (byte)0x84 }; public static byte[] hash(byte[] input) { int[] state = new int[9]; System.arraycopy(IV, 0, state, 0, 9); byte[] padded = pad(input); for (int i = 0; i < padded.length; i += 72) { byte[] block = new byte[72]; System.arraycopy(padded, i, block, 0, Math.min(72, padded.length - i)); processBlock(state, block); } return stateToBytes(state); } private static void processBlock(int[] state, byte[] block) { int[] M = new int[18]; ByteBuffer bb = ByteBuffer.wrap(block); for (int i = 0; i < 18 && bb.hasRemaining(); i++) { M[i] = bb.hasRemaining() ? bb.getInt() : 0; } for (int round = 0; round < 64; round++) { for (int i = 0; i < 9; i++) { state[i] ^= M[round % 18]; state[i] = Integer.rotateLeft(state[i], (round + i) % 32); state[i] ^= شمائل[i % شمائل.length]; } } } private static byte[] pad(byte[] input) { int blockSize = 72; int paddedLength = ((input.length + blockSize - 1) / blockSize) * blockSize; byte[] padded = new byte[paddedLength]; System.arraycopy(input, 0, padded, 0, input.length); padded[input.length] = (byte)0x80; return padded; } private static byte[] stateToBytes(int[] state) { ByteBuffer bb = ByteBuffer.allocate(36); for (int s : state) { bb.putInt(s); } return bb.array(); } } EOF At first the cryptography was designed for Syamailcoin which is the coin that I am creating, you can verify it first or see it in the X post on Alshen Feshiru's account. 9469999.9999999428 Max Supply and reward distribution using the Inevitability Stage i.e. we cannot get rewards beyond the limited number of Stages unless the current Stage has been completed, Read first about the abstract of Syamailcoin. Syamailcoin prevents natural falsehood—corruption from system limits. When bits flip, valid state becomes indistinguishable from corrupted state. Provide self-verification: state accumulation with exponomial growth and harmonic decay, 288-bit , factorial consensus, and balanced bit. System tolerates 14.47% Byzantine faults across four time-decreasing stages. Focusing on the main topic, I just want to propose to jointly produce a new Smartphone with the concept of Decentralization instead of Semi decentralized or Semi Central, this problem occurs only in the LITTLE ENDIAN section, what I only help is that SAI-288 Cryptography is implemented there but with the concept of BIG ENDIAN and ROTR, it is enough that it is completely That this latest smartphone will be safe but you need to verify or test my Cryptography because it is open. Volla Punks -> Any Cryptography is implemented and one of them is SAI-288 -> Customize it to your desired Programming language -> Modification of SAI-288 to BIG ENDIAN, ROTR -> Charging Speed is enough 21W = I hope that as much as possible the initial selling price is not too expensive so that I can order this even though we are different countries, I fully support this as it should be. -----BEGIN PGP PUBLIC KEY BLOCK----- Comment: User ID: Alshen Feshiru < mailto:alshenfeshiru@zohomail.com > Comment: Valid from: 06/10/2025 09:35 Comment: Valid until: 02/04/2033 12:00 Comment: Type: 448-bit EdDSA (secret key available) Comment: Usage: Signing, Encryption, Certifying User IDs Comment: Fingerprint: 5871D671C35C12147308395A464505DE1047DA134C01C8EBF8D18D6B8CBD7763 mEkFaOMrBhYAAAA/AytlcQHHbHV7SgCdlZnHrIjtxAfcYYzs9R5GGNK46dlgzFzR B+1X8BPoMimXLemj9yoBK+lfLO7OaTZ9klqAtCtBbHNoZW4gRmVzaGlydSA8YWxz aGVuZmVzaGlydUB6b2hvbWFpbC5jb20+iM0FExYKAE0iIQVYcdZxw1wSFHMIOVpG RQXeEEfaE0wByOv40Y1rjL13YwUCaOMrBgIbAwUJDhXYSgULCQgHAgIiAgYVCgkI CwIEFgIDAQIeBwIXgAAApU0Bx3DEN60mahYzDrGcFnvmZ/5UaBBQTnLoSfPwG8Hz fYt/pLE+S/yMOrbDdUrg6LG0t33bh7Pu4BxjAAHGIAca1udLBqQZ6mYwpBI6Z2S0 XVIx+glBORH6ynYgZGBZOTBarTts7UctN7D0pbBE+J4Y7w9ooDEAuEwFaOMrBhIA AABCAytlbwG/civ41G/UgMeMBiRTScXvU83nUgSPz4fma7iCz5ZVfUUP9wBuxVxd n7gODEf7mnjE8Vt8XHgOZ6kDAQoJiLIFGBYKADIiIQVYcdZxw1wSFHMIOVpGRQXe EEfaE0wByOv40Y1rjL13YwUCaOMrBgIbDAUJDhXYSgAAzGAByPZFSr2g/J57qB4r 3ISgR4+mn83R9+R2TZL7s1qnDsqjw+t6B/b28dwlVxSXgXJtAcbW2hDlzORJAAHG O8MVhPLaPra69/XvhuhZW9vOw4YXydY9aW+63KiNA6iIeZz9HczEOvT6vdWjIj8f aQN2OLDD/yUA =Gs+D -----END PGP PUBLIC KEY BLOCK----- Warm Regards, Alshen Feshiru <SYAMAILCOIN_2025-10-05_223651.pdf> Volla Systeme GmbH General Manager Dr. Jörg Wurzer Kölner Straße 102 42897 Remscheid Germany Phone +49 2191 59897 62 Email mailto:info@volla.systems Homepage volla.online Commercial register HRB 28033 B VAT number DE311418133

1 0

GM
by Alshen Feshiru 23 Nov '25

23 Nov '25

0.0002231668235294118

1 0

Re: Volla Punks
by Alshen Feshiru 23 Nov '25

23 Nov '25

The name Alshen Feshiru is honestly just a Pseudonym and I am not tied to a Company or anything Centralized, but I can or can help to be marketed not only in Europe but also Southeast Asia. If it is true that you agree to the proposal about this Cryptography collaboration for such as Producing a new Smartphone, if it is necessary to input Data or Forms, What should I fill out? because maybe your team can only log in or execute coding from the Server or Software Volla, whereas I may not be allowed, please note again that I will only help or give a map of Cryptography and Lithography, not all of them have to be Custom, sometimes the Standard is much better because it has been tested for dozens, decades. Best Regards, Alshen Feshiru ---- On Sat, 22 Nov 2025 23:37:27 +0900 info(a)volla.online wrote ---- Dwar Mr Feshiru, Thanks for your message and interest in our products. Not only do our smartphones and tablets seem to be a perfect fit for your needs, but so do our Volla Cloud with distributed data processing and storage, as well as our research into the Volla Meshnet as a distributed infrastructure for data transmission. As a retailer, you are welcome to sell our products with accessories. We also offer business customers the option of customizing the operating system and dual branding. With a planned smartphone, we could also offer your logo exclusively on the back of the device. Business customers can also flash our devices themselves. One of our customers is doing so. Let me know if are interested in a quote. If so, we would need the contact data of your company. With best regards Dr. Jörg Wurzer Actually I am interested in a product called Volla Phone Quintus and a coincidence I am the youngest former Cryptographer, Alshen Feshiru is just a Pseudonym name, but actually I am creating Software for anyone will get complete privacy, IP Location will be Pseudonymous and some intended Devices will get the Internet that no longer requires a centralized provider, As long as the electricity is scattered in the Oscillator moving upwards called Upward, it will defeat all attackers. Or it is possible for us to produce a new Smartphone from Volla, For example, with the name Volla Punks , you can also contact me this email or have a further conversation on the Cypherpunks mailing list, I am used to and almost always have conversations there if needed such as Cryptography consultations, Lithography and everything related to Decentralized privacy. I only help the Cryptography part either in mathematical calculations or modifications that are completely Decentralized, Anti-Bias Optoelectronics and coding decisions or something like that can be decided by your Production Team, I just give a map, I have a standalone Cryptography which is SAI-288 with Multi Languages, Anyone can Implement this with the JAVA Main Language but the other languages are C++ and Rust and Python and Swift, You can modify other Multi Languages to suit your needs but it would be better, the control is not on the Team or Vendor, import java.nio.ByteBuffer; import java.nio.ByteOrder; import java.util.Arrays; public class SAI288 { private static final int ROUNDS = 64; private static final int STATE_SIZE = 9; private static final int BLOCK_SIZE = 72; private static final int OUTPUT_SIZE = 36; private static final int[] IV = { 0x243F6A88, 0x85A308D3, 0x13198A2E, 0x03707344, 0xA4093822, 0x299F31D0, 0x082EFA98, 0xEC4E6C89, 0x452821E6 }; private int[] state = new int[STATE_SIZE]; private byte[] buffer = new byte[BLOCK_SIZE]; private byte[] midliner = new byte[BLOCK_SIZE]; private int bufferPos = 0; private long totalBytes = 0; public SAI288() { reset(); } public void reset() { System.arraycopy(IV, 0, state, 0, STATE_SIZE); Arrays.fill(buffer, (byte) 0); Arrays.fill(midliner, (byte) 0); bufferPos = 0; totalBytes = 0; } private void processMidliner(byte[] data) { for (int i = 0; i < data.length && i < BLOCK_SIZE; i++) { midliner[i] ^= data[i]; } } public void update(byte[] data) { update(data, 0, data.length); } public void update(byte[] data, int offset, int length) { processMidliner(Arrays.copyOfRange(data, offset, offset + Math.min(length, BLOCK_SIZE))); totalBytes += length; int remaining = length; int dataPos = offset; while (remaining > 0) { int toCopy = Math.min(remaining, BLOCK_SIZE - bufferPos); System.arraycopy(data, dataPos, buffer, bufferPos, toCopy); bufferPos += toCopy; dataPos += toCopy; remaining -= toCopy; if (bufferPos == BLOCK_SIZE) { processBlock(buffer); bufferPos = 0; } } } private void processBlock(byte[] block) { int[] m = new int[18]; ByteBuffer bb = ByteBuffer.wrap(block).order(ByteOrder.LITTLE_ENDIAN); for (int i = 0; i < 18 && bb.hasRemaining(); i++) { m[i] = bb.remaining() >= 4 ? bb.getInt() : 0; } for (int round = 0; round < ROUNDS; round++) { for (int i = 0; i < STATE_SIZE; i++) { state[i] ^= m[i % 18]; state[i] = Integer.rotateLeft(state[i], (round + i) % 32); if (i > 0) { state[i] += state[i - 1]; } } for (int i = 0; i < 18; i++) { m[i] = Integer.rotateRight(m[i] ^ state[i % STATE_SIZE], 7); } } } public byte[] digest() { byte[] padded = new byte[BLOCK_SIZE]; System.arraycopy(buffer, 0, padded, 0, bufferPos); padded[bufferPos] = (byte) 0x80; ByteBuffer bb = ByteBuffer.wrap(padded, BLOCK_SIZE - 8, 8).order(ByteOrder.LITTLE_ENDIAN); bb.putLong(totalBytes * 8); processBlock(padded); processBlock(midliner); ByteBuffer output = ByteBuffer.allocate(OUTPUT_SIZE).order(ByteOrder.LITTLE_ENDIAN); for (int i = 0; i < STATE_SIZE; i++) { output.putInt(state[i]); } byte[] result = new byte[OUTPUT_SIZE]; output.flip(); output.get(result); reset(); return result; } public static byte[] hash(byte[] data) { SAI288 hasher = new SAI288(); hasher.update(data); return hasher.digest(); } public static native byte[] hashNative(byte[] data); } Or the latest SAI-288 Cryptography import java.nio.ByteBuffer; import java.nio.charset.StandardCharsets; public class SAI288 { private static final int[] IV = { 0x243F6A88, 0x85A308D3, 0x13198A2E, 0x03707344, 0xA4093822, 0x299F31D0, 0x082EFA98, 0xEC4E6C89, 0x452821E6 }; private static final byte[] شمائل = { (byte)0xD8, (byte)0xB4, (byte)0xD9, (byte)0x85, (byte)0xD8, (byte)0xA7, (byte)0xD8, (byte)0xA6, (byte)0xD9, (byte)0x84 }; public static byte[] hash(byte[] input) { int[] state = new int[9]; System.arraycopy(IV, 0, state, 0, 9); byte[] padded = pad(input); for (int i = 0; i < padded.length; i += 72) { byte[] block = new byte[72]; System.arraycopy(padded, i, block, 0, Math.min(72, padded.length - i)); processBlock(state, block); } return stateToBytes(state); } private static void processBlock(int[] state, byte[] block) { int[] M = new int[18]; ByteBuffer bb = ByteBuffer.wrap(block); for (int i = 0; i < 18 && bb.hasRemaining(); i++) { M[i] = bb.hasRemaining() ? bb.getInt() : 0; } for (int round = 0; round < 64; round++) { for (int i = 0; i < 9; i++) { state[i] ^= M[round % 18]; state[i] = Integer.rotateLeft(state[i], (round + i) % 32); state[i] ^= شمائل[i % شمائل.length]; } } } private static byte[] pad(byte[] input) { int blockSize = 72; int paddedLength = ((input.length + blockSize - 1) / blockSize) * blockSize; ; byte[] padded = new byte[paddedLength]; System.arraycopy(input, 0, padded, 0, input.length); padded[input.length] = (byte)0x80; return padded; } private static byte[] stateToBytes(int[] state) { ByteBuffer bb = ByteBuffer.allocate(36); for (int s : state) { bb.putInt(s); } return bb.array(); } } Or if with CAT EOF, cat > src/main/java/org/syamailcoin/crypto/sai288/SAI288.java << 'EOF' package org.syamailcoin.crypto.sai288; import java.nio.ByteBuffer; import java.nio.charset.StandardCharsets; public class SAI288 { private static final int[] IV = { 0x243F6A88, 0x85A308D3, 0x13198A2E, 0x03707344, 0xA4093822, 0x299F31D0, 0x082EFA98, 0xEC4E6C89, 0x452821E6 }; private static final byte[] شمائل = { (byte)0xD8, (byte)0xB4, (byte)0xD9, (byte)0x85, (byte)0xD8, (byte)0xA7, (byte)0xD8, (byte)0xA6, (byte)0xD9, (byte)0x84 }; public static byte[] hash(byte[] input) { int[] state = new int[9]; System.arraycopy(IV, 0, state, 0, 9); byte[] padded = pad(input); for (int i = 0; i < padded.length; i += 72) { byte[] block = new byte[72]; System.arraycopy(padded, i, block, 0, Math.min(72, padded.length - i)); processBlock(state, block); } return stateToBytes(state); } private static void processBlock(int[] state, byte[] block) { int[] M = new int[18]; ByteBuffer bb = ByteBuffer.wrap(block); for (int i = 0; i < 18 && bb.hasRemaining(); i++) { M[i] = bb.hasRemaining() ? bb.getInt() : 0; } for (int round = 0; round < 64; round++) { for (int i = 0; i < 9; i++) { state[i] ^= M[round % 18]; state[i] = Integer.rotateLeft(state[i], (round + i) % 32); state[i] ^= شمائل[i % شمائل.length]; } } } private static byte[] pad(byte[] input) { int blockSize = 72; int paddedLength = ((input.length + blockSize - 1) / blockSize) * blockSize; byte[] padded = new byte[paddedLength]; System.arraycopy(input, 0, padded, 0, input.length); padded[input.length] = (byte)0x80; return padded; } private static byte[] stateToBytes(int[] state) { ByteBuffer bb = ByteBuffer.allocate(36); for (int s : state) { bb.putInt(s); } return bb.array(); } } EOF At first the cryptography was designed for Syamailcoin which is the coin that I am creating, you can verify it first or see it in the X post on Alshen Feshiru's account. 9469999.9999999428 Max Supply and reward distribution using the Inevitability Stage i.e. we cannot get rewards beyond the limited number of Stages unless the current Stage has been completed, Read first about the abstract of Syamailcoin. Syamailcoin prevents natural falsehood—corruption from system limits. When bits flip, valid state becomes indistinguishable from corrupted state. Provide self-verification: state accumulation with exponomial growth and harmonic decay, 288-bit , factorial consensus, and balanced bit. System tolerates 14.47% Byzantine faults across four time-decreasing stages. Focusing on the main topic, I just want to propose to jointly produce a new Smartphone with the concept of Decentralization instead of Semi decentralized or Semi Central, this problem occurs only in the LITTLE ENDIAN section, what I only help is that SAI-288 Cryptography is implemented there but with the concept of BIG ENDIAN and ROTR, it is enough that it is completely That this latest smartphone will be safe but you need to verify or test my Cryptography because it is open. Volla Punks -> Any Cryptography is implemented and one of them is SAI-288 -> Customize it to your desired Programming language -> Modification of SAI-288 to BIG ENDIAN, ROTR -> Charging Speed is enough 21W = I hope that as much as possible the initial selling price is not too expensive so that I can order this even though we are different countries, I fully support this as it should be. -----BEGIN PGP PUBLIC KEY BLOCK----- Comment: User ID: Alshen Feshiru < mailto:alshenfeshiru@zohomail.com > Comment: Valid from: 06/10/2025 09:35 Comment: Valid until: 02/04/2033 12:00 Comment: Type: 448-bit EdDSA (secret key available) Comment: Usage: Signing, Encryption, Certifying User IDs Comment: Fingerprint: 5871D671C35C12147308395A464505DE1047DA134C01C8EBF8D18D6B8CBD7763 mEkFaOMrBhYAAAA/AytlcQHHbHV7SgCdlZnHrIjtxAfcYYzs9R5GGNK46dlgzFzR B+1X8BPoMimXLemj9yoBK+lfLO7OaTZ9klqAtCtBbHNoZW4gRmVzaGlydSA8YWxz aGVuZmVzaGlydUB6b2hvbWFpbC5jb20+iM0FExYKAE0iIQVYcdZxw1wSFHMIOVpG RQXeEEfaE0wByOv40Y1rjL13YwUCaOMrBgIbAwUJDhXYSgULCQgHAgIiAgYVCgkI CwIEFgIDAQIeBwIXgAAApU0Bx3DEN60mahYzDrGcFnvmZ/5UaBBQTnLoSfPwG8Hz fYt/pLE+S/yMOrbDdUrg6LG0t33bh7Pu4BxjAAHGIAca1udLBqQZ6mYwpBI6Z2S0 XVIx+glBORH6ynYgZGBZOTBarTts7UctN7D0pbBE+J4Y7w9ooDEAuEwFaOMrBhIA AABCAytlbwG/civ41G/UgMeMBiRTScXvU83nUgSPz4fma7iCz5ZVfUUP9wBuxVxd n7gODEf7mnjE8Vt8XHgOZ6kDAQoJiLIFGBYKADIiIQVYcdZxw1wSFHMIOVpGRQXe EEfaE0wByOv40Y1rjL13YwUCaOMrBgIbDAUJDhXYSgAAzGAByPZFSr2g/J57qB4r 3ISgR4+mn83R9+R2TZL7s1qnDsqjw+t6B/b28dwlVxSXgXJtAcbW2hDlzORJAAHG O8MVhPLaPra69/XvhuhZW9vOw4YXydY9aW+63KiNA6iIeZz9HczEOvT6vdWjIj8f aQN2OLDD/yUA =Gs+D -----END PGP PUBLIC KEY BLOCK----- Warm Regards, Alshen Feshiru <SYAMAILCOIN_2025-10-05_223651.pdf> Volla Systeme GmbH General Manager Dr. Jörg Wurzer Kölner Straße 102 42897 Remscheid Germany Phone +49 2191 59897 62 Email mailto:info@volla.systems Homepage volla.online Commercial register HRB 28033 B VAT number DE311418133

1 0

Volla Punks
by Alshen Feshiru 22 Nov '25

22 Nov '25

Dear Volla, Actually I am interested in a product called Volla Phone Quintus and a coincidence I am the youngest former Cryptographer, Alshen Feshiru is just a Pseudonym name, but actually I am creating Software for anyone will get complete privacy, IP Location will be Pseudonymous and some intended Devices will get the Internet that no longer requires a centralized provider, As long as the electricity is scattered in the Oscillator moving upwards called Upward, it will defeat all attackers. Or it is possible for us to produce a new Smartphone from Volla, For example, with the name Volla Punks , you can also contact me this email or have a further conversation on the Cypherpunks mailing list, I am used to and almost always have conversations there if needed such as Cryptography consultations, Lithography and everything related to Decentralized privacy. I only help the Cryptography part either in mathematical calculations or modifications that are completely Decentralized, Anti-Bias Optoelectronics and coding decisions or something like that can be decided by your Production Team, I just give a map, I have a standalone Cryptography which is SAI-288 with Multi Languages, Anyone can Implement this with the JAVA Main Language but the other languages are C++ and Rust and Python and Swift, You can modify other Multi Languages to suit your needs but it would be better, the control is not on the Team or Vendor, import java.nio.ByteBuffer; import java.nio.ByteOrder; import java.util.Arrays; public class SAI288 { private static final int ROUNDS = 64; private static final int STATE_SIZE = 9; private static final int BLOCK_SIZE = 72; private static final int OUTPUT_SIZE = 36; private static final int[] IV = { 0x243F6A88, 0x85A308D3, 0x13198A2E, 0x03707344, 0xA4093822, 0x299F31D0, 0x082EFA98, 0xEC4E6C89, 0x452821E6 }; private int[] state = new int[STATE_SIZE]; private byte[] buffer = new byte[BLOCK_SIZE]; private byte[] midliner = new byte[BLOCK_SIZE]; private int bufferPos = 0; private long totalBytes = 0; public SAI288() { reset(); } public void reset() { System.arraycopy(IV, 0, state, 0, STATE_SIZE); Arrays.fill(buffer, (byte) 0); Arrays.fill(midliner, (byte) 0); bufferPos = 0; totalBytes = 0; } private void processMidliner(byte[] data) { for (int i = 0; i < data.length && i < BLOCK_SIZE; i++) { midliner[i] ^= data[i]; } } public void update(byte[] data) { update(data, 0, data.length); } public void update(byte[] data, int offset, int length) { processMidliner(Arrays.copyOfRange(data, offset, offset + Math.min(length, BLOCK_SIZE))); totalBytes += length; int remaining = length; int dataPos = offset; while (remaining > 0) { int toCopy = Math.min(remaining, BLOCK_SIZE - bufferPos); System.arraycopy(data, dataPos, buffer, bufferPos, toCopy); bufferPos += toCopy; dataPos += toCopy; remaining -= toCopy; if (bufferPos == BLOCK_SIZE) { processBlock(buffer); bufferPos = 0; } } } private void processBlock(byte[] block) { int[] m = new int[18]; ByteBuffer bb = ByteBuffer.wrap(block).order(ByteOrder.LITTLE_ENDIAN); for (int i = 0; i < 18 && bb.hasRemaining(); i++) { m[i] = bb.remaining() >= 4 ? bb.getInt() : 0; } for (int round = 0; round < ROUNDS; round++) { for (int i = 0; i < STATE_SIZE; i++) { state[i] ^= m[i % 18]; state[i] = Integer.rotateLeft(state[i], (round + i) % 32); if (i > 0) { state[i] += state[i - 1]; } } for (int i = 0; i < 18; i++) { m[i] = Integer.rotateRight(m[i] ^ state[i % STATE_SIZE], 7); } } } public byte[] digest() { byte[] padded = new byte[BLOCK_SIZE]; System.arraycopy(buffer, 0, padded, 0, bufferPos); padded[bufferPos] = (byte) 0x80; ByteBuffer bb = ByteBuffer.wrap(padded, BLOCK_SIZE - 8, 8).order(ByteOrder.LITTLE_ENDIAN); bb.putLong(totalBytes * 8); processBlock(padded); processBlock(midliner); ByteBuffer output = ByteBuffer.allocate(OUTPUT_SIZE).order(ByteOrder.LITTLE_ENDIAN); for (int i = 0; i < STATE_SIZE; i++) { output.putInt(state[i]); } byte[] result = new byte[OUTPUT_SIZE]; output.flip(); output.get(result); reset(); return result; } public static byte[] hash(byte[] data) { SAI288 hasher = new SAI288(); hasher.update(data); return hasher.digest(); } public static native byte[] hashNative(byte[] data); } Or the latest SAI-288 Cryptography import java.nio.ByteBuffer; import java.nio.charset.StandardCharsets; public class SAI288 { private static final int[] IV = { 0x243F6A88, 0x85A308D3, 0x13198A2E, 0x03707344, 0xA4093822, 0x299F31D0, 0x082EFA98, 0xEC4E6C89, 0x452821E6 }; private static final byte[] شمائل = { (byte)0xD8, (byte)0xB4, (byte)0xD9, (byte)0x85, (byte)0xD8, (byte)0xA7, (byte)0xD8, (byte)0xA6, (byte)0xD9, (byte)0x84 }; public static byte[] hash(byte[] input) { int[] state = new int[9]; System.arraycopy(IV, 0, state, 0, 9); byte[] padded = pad(input); for (int i = 0; i < padded.length; i += 72) { byte[] block = new byte[72]; System.arraycopy(padded, i, block, 0, Math.min(72, padded.length - i)); processBlock(state, block); } return stateToBytes(state); } private static void processBlock(int[] state, byte[] block) { int[] M = new int[18]; ByteBuffer bb = ByteBuffer.wrap(block); for (int i = 0; i < 18 && bb.hasRemaining(); i++) { M[i] = bb.hasRemaining() ? bb.getInt() : 0; } for (int round = 0; round < 64; round++) { for (int i = 0; i < 9; i++) { state[i] ^= M[round % 18]; state[i] = Integer.rotateLeft(state[i], (round + i) % 32); state[i] ^= شمائل[i % شمائل.length]; } } } private static byte[] pad(byte[] input) { int blockSize = 72; int paddedLength = ((input.length + blockSize - 1) / blockSize) * blockSize; byte[] padded = new byte[paddedLength]; System.arraycopy(input, 0, padded, 0, input.length); padded[input.length] = (byte)0x80; return padded; } private static byte[] stateToBytes(int[] state) { ByteBuffer bb = ByteBuffer.allocate(36); for (int s : state) { bb.putInt(s); } return bb.array(); } } Or if with CAT EOF, cat > src/main/java/org/syamailcoin/crypto/sai288/SAI288.java << 'EOF' package org.syamailcoin.crypto.sai288; import java.nio.ByteBuffer; import java.nio.charset.StandardCharsets; public class SAI288 { private static final int[] IV = { 0x243F6A88, 0x85A308D3, 0x13198A2E, 0x03707344, 0xA4093822, 0x299F31D0, 0x082EFA98, 0xEC4E6C89, 0x452821E6 }; private static final byte[] شمائل = { (byte)0xD8, (byte)0xB4, (byte)0xD9, (byte)0x85, (byte)0xD8, (byte)0xA7, (byte)0xD8, (byte)0xA6, (byte)0xD9, (byte)0x84 }; public static byte[] hash(byte[] input) { int[] state = new int[9]; System.arraycopy(IV, 0, state, 0, 9); byte[] padded = pad(input); for (int i = 0; i < padded.length; i += 72) { byte[] block = new byte[72]; System.arraycopy(padded, i, block, 0, Math.min(72, padded.length - i)); processBlock(state, block); } return stateToBytes(state); } private static void processBlock(int[] state, byte[] block) { int[] M = new int[18]; ByteBuffer bb = ByteBuffer.wrap(block); for (int i = 0; i < 18 && bb.hasRemaining(); i++) { M[i] = bb.hasRemaining() ? bb.getInt() : 0; } for (int round = 0; round < 64; round++) { for (int i = 0; i < 9; i++) { state[i] ^= M[round % 18]; state[i] = Integer.rotateLeft(state[i], (round + i) % 32); state[i] ^= شمائل[i % شمائل.length]; } } } private static byte[] pad(byte[] input) { int blockSize = 72; int paddedLength = ((input.length + blockSize - 1) / blockSize) * blockSize; byte[] padded = new byte[paddedLength]; System.arraycopy(input, 0, padded, 0, input.length); padded[input.length] = (byte)0x80; return padded; } private static byte[] stateToBytes(int[] state) { ByteBuffer bb = ByteBuffer.allocate(36); for (int s : state) { bb.putInt(s); } return bb.array(); } } EOF At first the cryptography was designed for Syamailcoin which is the coin that I am creating, you can verify it first or see it in the X post on Alshen Feshiru's account. 9469999.9999999428 Max Supply and reward distribution using the Inevitability Stage i.e. we cannot get rewards beyond the limited number of Stages unless the current Stage has been completed, Read first about the abstract of Syamailcoin. Syamailcoin prevents natural falsehood—corruption from system limits. When bits flip, valid state becomes indistinguishable from corrupted state. Provide self-verification: state accumulation with exponomial growth and harmonic decay, 288-bit , factorial consensus, and balanced bit. System tolerates 14.47% Byzantine faults across four time-decreasing stages. Focusing on the main topic, I just want to propose to jointly produce a new Smartphone with the concept of Decentralization instead of Semi decentralized or Semi Central, this problem occurs only in the LITTLE ENDIAN section, what I only help is that SAI-288 Cryptography is implemented there but with the concept of BIG ENDIAN and ROTR, it is enough that it is completely That this latest smartphone will be safe but you need to verify or test my Cryptography because it is open. Volla Punks -> Any Cryptography is implemented and one of them is SAI-288 -> Customize it to your desired Programming language -> Modification of SAI-288 to BIG ENDIAN, ROTR -> Charging Speed is enough 21W = I hope that as much as possible the initial selling price is not too expensive so that I can order this even though we are different countries, I fully support this as it should be. -----BEGIN PGP PUBLIC KEY BLOCK----- Comment: User ID: Alshen Feshiru <alshenfeshiru(a)zohomail.com> Comment: Valid from: 06/10/2025 09:35 Comment: Valid until: 02/04/2033 12:00 Comment: Type: 448-bit EdDSA (secret key available) Comment: Usage: Signing, Encryption, Certifying User IDs Comment: Fingerprint: 5871D671C35C12147308395A464505DE1047DA134C01C8EBF8D18D6B8CBD7763 mEkFaOMrBhYAAAA/AytlcQHHbHV7SgCdlZnHrIjtxAfcYYzs9R5GGNK46dlgzFzR B+1X8BPoMimXLemj9yoBK+lfLO7OaTZ9klqAtCtBbHNoZW4gRmVzaGlydSA8YWxz aGVuZmVzaGlydUB6b2hvbWFpbC5jb20+iM0FExYKAE0iIQVYcdZxw1wSFHMIOVpG RQXeEEfaE0wByOv40Y1rjL13YwUCaOMrBgIbAwUJDhXYSgULCQgHAgIiAgYVCgkI CwIEFgIDAQIeBwIXgAAApU0Bx3DEN60mahYzDrGcFnvmZ/5UaBBQTnLoSfPwG8Hz fYt/pLE+S/yMOrbDdUrg6LG0t33bh7Pu4BxjAAHGIAca1udLBqQZ6mYwpBI6Z2S0 XVIx+glBORH6ynYgZGBZOTBarTts7UctN7D0pbBE+J4Y7w9ooDEAuEwFaOMrBhIA AABCAytlbwG/civ41G/UgMeMBiRTScXvU83nUgSPz4fma7iCz5ZVfUUP9wBuxVxd n7gODEf7mnjE8Vt8XHgOZ6kDAQoJiLIFGBYKADIiIQVYcdZxw1wSFHMIOVpGRQXe EEfaE0wByOv40Y1rjL13YwUCaOMrBgIbDAUJDhXYSgAAzGAByPZFSr2g/J57qB4r 3ISgR4+mn83R9+R2TZL7s1qnDsqjw+t6B/b28dwlVxSXgXJtAcbW2hDlzORJAAHG O8MVhPLaPra69/XvhuhZW9vOw4YXydY9aW+63KiNA6iIeZz9HczEOvT6vdWjIj8f aQN2OLDD/yUA =Gs+D -----END PGP PUBLIC KEY BLOCK----- Warm Regards, Alshen Feshiru

1 0