Pratik Mishra

Pratik Mishra

Pratik is an engineering lead at Google One, building subscriptions and enabling AI monetization across Google products. His areas of expertise include large-scale distributed systems, data infrastructure, and AI commercialization. He leads efforts that define the infrastructure and monetization strategy of Google's flagship subscriptions platform with over 200 million paying subscribers.

He serves on the Program Committees for premier conferences and as a reviewer for prestigious peer-reviewed journals Furthermore, he lends his expertise to judging committees for top industry awards, including the CES Innovation Awards.
Authored Publications
Sort By
  • Title
  • Title, descending
  • Year
  • Year, descending
Preview abstract Config-driven user interface (CDUI), also called server-driven user interface, moves user interface (UI) layout out of the app binary into server responses so teams can update screens without an app store release. Because one schema serves many installed app versions, edits to it can break older apps. We statically compared parsed schema declarations across four open-source runtime CDUI engines (Yandex DivKit, Cash App Redwood, EnsembleUI, and archived Spotify HubFramework) and one inactive comparator compiled at build time (Airbnb Lona). Out of 1447 commits touching schema paths, 730 modify a runtime engine’s schema: 61.4% only add declarations, 38.1% remove or retype declarations, and 0.5% mark deprecations (93% parser accuracy against two-rater human labels). Standalone schema files had a higher share of additive commits than schemas written in code, though across four runtime engines this difference is not statistically significant. By Fisher’s exact test across commit halves, breaking edits fell significantly only in Redwood (73.3% to 25.0%, 𝑝=0.012). Finally, we compare systems across modularity, centralization, and strictness, showing when additions still break older clients (including Redwood throwing by default). View details
Preview abstract Subscription software must answer one question on every request: may this user do this, now? Production systems usually treat the answer as authoritative state, read at request time, and assume that stronger consistency is always safer. We systematize what is publicly known about entitlement correct- ness when billing truth is owned externally, and ask whether the consistency- token protocols of internal authorization transfer to it. Method. A multivocal review of 85 sources, two propositions, an error-cost model, TLC model checking, and a seeded simulation of 20,000 subscribers replicated across ten seeds. No Zanzibar-style token can exist for entitlement, because external billers share neither a write path nor a clock; staleness bounded by the recon- ciliation interval is achievable instead. In simulation the projection dominates: applying revocations at their effective time rather than on arrival cuts expected cost 27-fold, more than every freshness parameter combined. Under partition, serving the last snapshot dominates; failing open beats failing closed for sub- scribers whenever the cost ratio ρ of false denial to over-service exceeds about 0.35, but the break-even reaches 26 when 5% of users pay. A revocation hold- over pays only against spurious revocations, never beyond the reconciliation interval, and daily reconciliation makes error nearly insensitive to notification loss. Entitlement should be engineered as an eventually consistent derived view with an effective-time projection, per-class staleness bounds, and reconciliation as its source of truth. We contribute a vocabulary, six invariants, a reference architecture, a model-checked specification, and an open simulator. View details
×