Minision Privacy Policy

Overview

Mini Missions keeps data lean — local streaks, XP, badges plus anonymous posts, likes and comments.

Identity

You appear via a random alias + anonymous Firebase Auth UID; we do not collect real names or emails.

Third Parties

Firebase (Auth, Firestore) for core data; Supabase Storage for post images; OneSignal for optional notifications.

Images

Before upload, images are resized/compressed to reduce bandwidth. Avoid sensitive or personal images.

Storage & Deletion

Deleting a post removes its associated image(s) from Supabase (best-effort).

Permissions

Camera / gallery only accessed when you pick images. Notifications are opt-in; if declined we never auto-prompt again.

Data Minimization

We store likeCount/commentCount for ranking — no behavioral profiling.

Security

Firestore rules and storage policies aim to block unauthorized writes; please report issues.

Analytics

No marketing analytics; only basic Firebase platform diagnostics may be collected.

Retention

Mission logs capped (older entries trimmed). You may clear local progress via Settings → Reset.

Contact

Privacy questions → soulunic7@gmail.com

Comments

Post a Comment

Popular posts from this blog

Code

 #include <stdio.h> #include <stdlib.h> // Function to merge two subarrays of arr[] void merge(int arr[], int left, int middle, int right) {     int i, j, k;     int n1 = middle - left + 1;     int n2 = right - middle;     // Create temporary arrays     int L[n1], R[n2];     // Copy data to temporary arrays L[] and R[]     for (i = 0; i < n1; i++)         L[i] = arr[left + i];     for (j = 0; j < n2; j++)         R[j] = arr[middle + 1 + j];     // Merge the temporary arrays back into arr[l..r]     i = 0; // Initial index of first subarray     j = 0; // Initial index of second subarray     k = left; // Initial index of merged subarray     while (i < n1 && j < n2) {         if (L[i] <= R[j]) {             arr[k] = L[i];   ...
Read more
Write a program to implement Circular Queue using Array in c language  ChatGPT Certainly! Here's a simple implementation of a Circular Queue using an array in the C language: c Copy code #include <stdio.h> #define MAX_SIZE 5 // Structure to represent the Circular Queue struct CircularQueue {     int items[MAX_SIZE];     int front, rear; }; // Function to initialize the Circular Queue void initializeQueue(struct CircularQueue* queue) {     queue->front = -1;     queue->rear = -1; } // Function to check if the Circular Queue is empty int isEmpty(struct CircularQueue* queue) {     return (queue->front == -1 && queue->rear == -1); } // Function to check if the Circular Queue is full int isFull(struct CircularQueue* queue) {     return ((queue->rear + 1) % MAX_SIZE == queue->front); } // Function to enqueue an element into the Circular Queue void enqueue(struct CircularQueue* queue, int value) { ...
Read more