ICP World (@ICPWorld777) header
ICP World (@ICPWorld777) profile picture

Subscribe: https://teapawt.net/t.co/ztLF0bQWJy

Joined January 2023
Photo by ICP World (@ICPWorld777)Photo by ICP World (@ICPWorld777)Photo by ICP World (@ICPWorld777)Photo by ICP World (@ICPWorld777)Photo by ICP World (@ICPWorld777)Photo by ICP World (@ICPWorld777)Photo by ICP World (@ICPWorld777)Photo by ICP World (@ICPWorld777)Photo by ICP World (@ICPWorld777)Photo by ICP World (@ICPWorld777)
What do you think about this $ICP fam? Are these other chains threatened by Internet Computer, I think so!
What if hackers are paying influencers to undermine #ICP and stop it from gaining popularity? While people ignore its real-world use cases, hackers keep exploiting outdated systems. 😓 This video 7 yrs ago youtu.be/PuzJi0zFxt4?si=_AP2…
1
9
242
$ICP has real adoption!
If you are calling $ICP irrelevant today. History has a funny way of making people regret that. That’s how you know you’re still early. The technology is real. The infrastructure is real. Adoption is getting closer. One day, you’ll wish you paid attention when it was right in front of you. The world computer is coming. ☁️ — Cloudlord ☁️
2
13
223
Dfinity are some of the smartest people on the planet, pay attention to what's being built with $ICP
In a recent exclusive MSB Intel interview in the UAE: DFINITY founder, Dominic Williams, said Pakistan is creating a national chat app on ICP infrastructure that will have +100M users. @dominic_w @dfinity
2
6
64
837
$ICP = World Computer ♾
The man trying to enable a sovereign online future built by AI @dominic_w “Cloud engines allow enterprises to configure the precise compute nodes the network combines to create their cloud infrastructure, creating the ultimate sovereign platforms.” $ICP = World Computer ♾
3
25
313
$ICP will have Global Domination!
PAKISTAN WANTS ITS OWN GOVERNMENT AI FACTORY ON THE INTERNET COMPUTER Pakistan's Digital Authority met DFINITY in Dubai to discuss a "sovereign AI factory", meaning AI tools built and run by Pakistan itself for public offices. It's their second meeting this year. A non-binding February deal included 1,500 licenses for DFINITY's AI coding tool, Caffeine.
5
39
464
This is big $ICP fam!
One of our most requested interviews is finally here! We sit down with @dominic_w founder of @dfinity to explore the future of the internet, AI, blockchain and the groundbreaking vision behind $ICP. 🎙️ Full episode tomorrow at 6:30 PM UK! Don't miss it! 🚀
6
75
1,018
internet-computer:native will come out on top! 100% 💚
$ICP will come out on top, it doesn't matter which blockchain it's up against!
1
4
29
295
internet-computer:native in my eyes will shock and the world and some people have already woken up to internet-computer:native 💚
$ICP will shock the world!
2
12
125
More and more users are being onboarded to $ICP!
Internet Computer’s active addresses rise 35% and new addresses climb 45%, while the network processes 201.1M transactions in one day. ICP trades near $2.77 as Crypto With Gopal eyes a breakout above $4.10 for a potential move toward $6.50–$7.00. 📈 🚀 tronweekly.com/internet-comp…
5
46
647
$ICP will come out on top, it doesn't matter which blockchain it's up against!
The Code Is Public. So Is the Patent. NEAR's own public repository implements a signing flow that maps closely onto a DFINITY patent, explicitly cites the underlying Groth–Shoup work, and NEAR is now replacing that flow with an architecture that removes the patent-sensitive steps. That is the conclusion I reached after comparing the patent claims directly against NEAR’s public code and development history. Not community rumors. Not tribal narratives. Not price speculation. The patent, the source code and the migration history are all public. This is not a court ruling. It does not prove intent, theft or legal liability. But the technical overlap is substantial enough that this can no longer be dismissed as ordinary crypto drama. The patent The central document is U.S. Patent 12,695,626 B2, titled: “Digital signatures with re-randomized presignatures.” It lists Jens Groth and Victor Shoup as inventors, DFINITY Stiftung as assignee, claims priority from September 30, 2021, and was granted on July 28, 2026. Google Patents The independent Claim 1 describes a signing method with five essential steps: A presignature is computed. A signing request for a message is received. A non-predictable public re-randomization value is computed after that request. That value is used to re-randomize the presignature. The message is signed using the re-randomized presignature. Google Patents That sequence matters because it is not merely a broad description of threshold cryptography. It describes a particular order of operations. And NEAR’s stored-presignature signing flow maps closely onto it. The NEAR flow In NEAR’s public MPC repository, the relevant legacy path can be reduced to this: Presignature computed and stored → signing request arrives → public re-randomization value δ is derived → presignature is re-randomized → signature is produced The implementation contains types and functions named: PresignOutput RerandomizedPresignOutput RerandomizationArguments derive_randomness rerandomize_presign The re-randomization value is derived using HKDF-SHA3-256 from a combination of the public key, key-derivation tweak, message hash, presignature commitment, participants and public entropy originating from the network. The resulting value is then used to transform the stored presignature before the ECDSA signing protocol is executed. That is not merely conceptual similarity. It is a recognizable claim-by-claim technical mapping: Compute a presignature: present. Receive a signing request: present. Generate a public, unpredictable re-randomization value for that request: apparently present. Use it to re-randomize the presignature: present. Sign with the resulting presignature: present. The most legally sensitive question would be how a court interprets the requirement that the re-randomization value be “generated after receiving the signing request.” But NEAR’s execution path appears to calculate the final delta from request-specific data after the request enters the signing pipeline. That is a real issue for patent counsel to examine—not a superficial resemblance. The dependent claims make the overlap more interesting The patent’s dependent claims narrow the method into several specific implementations: Threshold signatures. Pseudo-random generation of the re-randomization value. Applying a hash function to the message, public key or other inputs. Deriving public randomness from a random beacon. Discrete-logarithm signatures. ECDSA over elliptic curves. Google Patents NEAR’s system uses threshold ECDSA, derives delta pseudorandomly through HKDF-SHA3-256, includes the message hash and public-key-related data in the derivation, and uses public block entropy as an input. Whether NEAR’s block entropy legally qualifies as the patent’s “random beacon” would require formal claim construction. But the patent itself describes a random beacon broadly as publicly available randomness supplied by the distributed network. Google Patents That makes Claims 5 through 10 particularly relevant to any serious infringement analysis. The repository identifies the underlying work The historical record is also difficult to ignore. In November 2024, NEAR merged PR #50: “Simon/rerandomize key derivation.” The commit history explicitly described the change as: “Rerandomize using the GS21 variant.” And the implementation itself identified the re-randomization as a variant of GS21. GS21 refers to the Groth–Shoup work underlying DFINITY’s research on ECDSA with additive key derivation and re-randomized presignatures. This proves something important—but not everything. It proves that NEAR’s developers were aware of and intentionally implemented ideas derived from the Groth–Shoup work. It does not, by itself, prove that they knowingly infringed a patent, misappropriated confidential information or intended to harm DFINITY. Scientific work can be publicly readable while implementations of it remain subject to patent rights. A paper being public does not automatically create a patent licence. That distinction matters. There is also an additive key-derivation overlap NEAR’s Tweak implementation derives keys using the algebraic form: x′ = x + tweak X′ = X + tweak·G The same DFINITY patent contains dependent claims covering additive shifting of a secret and public master key: d′ = d + e D′ = D + eG. Google Patents The symbols differ. The algebraic construction is essentially the same. That does not automatically establish infringement of Claims 16 and 17, because dependent claims incorporate all limitations of the claims from which they depend. But it adds another technically significant correspondence that cannot simply be waved away. Not every claim maps There is also an important difference, and it should be stated clearly. Claim 11 describes a specific additive re-randomization formula: r = r′ + δ R = R′ + δG NEAR’s stored-presignature implementation uses a multiplicative transformation in which the nonce commitment is scaled by delta, while related secret shares are adjusted by its inverse. Therefore, Claim 11 is not an obvious case of literal infringement. That matters because a serious analysis should identify both the matches and the differences. But Claim 1 is broader. It does not require the precise formula found in Claim 11. It requires that a public, non-predictable value generated after the request be used to re-randomize a presignature before signing. The broader Claim 1 is where the strongest potential mapping remains. Then NEAR changed the architecture On September 14, 2026, NEAR merged PR #4386, introducing a new presign_and_sign protocol. Instead of calculating and storing a presignature before the message is known, the new path consumes fresh cryptographic triples only after the message hash is available. Presigning and signing occur within a single online protocol, and no presignature is stored. GitHub The new path also removes the old request-specific re-randomization step. The pull request describes the key-derivation adjustment as effectively using δ = 1, rather than deriving a fresh delta and using it to re-randomize a stored presignature. The repository’s own review discussion explicitly contrasts this with the classic path and notes that delta no longer binds R to the message hash. GitHub Technically, the difference is striking: Old path Stored presignature → request-specific δ → re-randomization → signing New path Request arrives → fresh presign computation → immediate signing → nothing stored to re-randomize The new construction pays for that simplification with two additional online communication round trips. Then, on September 25, PR #4503 integrated the new path into NEAR’s node software. Its author stated that the team planned to remove the existing Cait-Sith implementation later, while temporarily retaining it as a fallback during the upgrade. GitHub The migration has continued. On October 21, 2026, NEAR merged PR #4792, extending the online-presign architecture to foreign-chain transaction signing. The repository also references a separate effort, PR #4751, to remove the stored-presignature signing path from the node altogether. GitHub Is this a patent design-around? Technically, it looks like one. The older architecture contains the sequence most relevant to DFINITY’s Claim 1: stored presignature + post-request public δ + re-randomization + signature. The replacement architecture removes: the stored presignature and the post-request re-randomization of that stored presignature. Those are precisely the patent-sensitive steps. But GitHub does not establish why NEAR made the change. A design-around is not an admission of infringement. It can be good engineering, a security simplification, an operational trade-off or prudent intellectual-property risk management. Therefore, the accurate conclusion is not: “GitHub proves NEAR changed the system because it feared DFINITY’s patent.” The accurate conclusion is: “GitHub proves that NEAR is replacing the relevant flow with one that removes the elements most likely to trigger the patent claim.” The motive remains an inference. The architectural change is a fact. What the public evidence establishes The public record establishes that DFINITY holds a granted U.S. patent covering re-randomized presignature signing flows. It establishes that NEAR implemented a stored-presignature threshold-ECDSA flow with request-specific public re-randomization. It establishes that NEAR’s repository explicitly referenced the Groth–Shoup work. It establishes that multiple elements of DFINITY’s independent and dependent claims appear in NEAR’s implementation. And it establishes that NEAR is now migrating toward an architecture that eliminates the stored-presignature and re-randomization sequence. What the public record does not establish is a judicial finding of infringement, intentional theft, criminal conduct, willfulness, damages or liability. Those conclusions would require patent claim construction, deployment evidence, territorial analysis, validity review, prosecution-history analysis and a formal legal process. The real conclusion Dominic Williams’ entire public account should not automatically be treated as proven. But the central technical allegation can no longer be dismissed as unsupported. NEAR’s own repository provides enough evidence to justify a professional claim chart comparing its stored-presignature implementation against US 12,695,626 B2. It also provides enough evidence to justify serious discussions about attribution, licensing and potential remedies. DFINITY invested years in foundational cryptographic research. NEAR publicly implemented a closely related signing flow. The underlying work was explicitly recognized in its repository. And the relevant architecture is now being replaced. This is not about tribal loyalty to ICP or hostility toward NEAR. It is about whether organizations that fund difficult, first-principles research can protect the resulting inventions—and whether other projects can commercialize those inventions without permission, attribution or compensation. NEAR deserves the opportunity to answer. But that answer should be technical and claim-by-claim. Not slogans. Not social-media deflection. Not another round of crypto tribalism. The code is public. The patent is public. The migration is public. Now the explanation should be public too. ∞ #WorldComputer #InternetComputer #ICP
1
4
1
30
779
$ICP will shock the world!
I think the $ICP community agrees:
6
1
35
691
Great video here $ICP fam
$ICP fam, here's everything we know about the $NEAR situation, based on everything I could find publicly. RT for visibility, and consider watching it on YT 👌
1
11
47
591
$ICP on chain activity keeps climbing, Internet Computer will skyrocket!
🚨 $ICP NETWORK ACTIVITY IS CLIMBING — THE DATA IS HARD TO IGNORE. 6,495 transactions/sec. 1.17M+ canister smart contracts. 30-day update-call average: 1,701/sec, up 58% YoY. Network usage is growing, but activity alone doesn't guarantee price appreciation. The real catalyst is turning this usage into sustained demand for $ICP. 🔥
1
2
40
481
$ICP is so great other AI crypto projects have stolen its tech, justice will be served!
Did NEAR Intents use unlicensed DFINITY tech? 🚨 @dominic_w says NEAR built its star product on stolen DFINITY research NEAR's own docs link straight to the DFINITY paper (spotted by @ajki76) 👇 #ICP
3
5
42
657
$ICP was the first innovator of subnets, move over Bittensor!
ICP combines high-performance node machines, independent providers, globally distributed data centers, subnet architecture, and chain-key cryptography into a purpose-built network designed to run applications and serve web experiences directly. That’s a very different infrastructure model from a typical blockchain stack. 💚🫶♾️ #ICP #InternetComputer #InternetComputerProtocol #DFINITY #BlockchainInfrastructure internet-computer:native
4
27
429