THE PRIVACY PARADOX: Blockchains, AI, Quantum Algorithms, & The Future of Data Security
THE PRIVACY PARADOX: Blockchains, AI, Quantum Algorithms, & The Future of Data Security
BLOCKCHAINs?
How many of you interested to make a career in
AI ?
How many of you interested to make a career in
QUANTUM ?
Let’s First Discuss
BLOCKCHAIN
FIRST
BLOCK
CHAIN
CRYPTOCURRENCY IS ANATTEMPT TO
BRING BACK A DECENTRALISED
CURRENCY OF PEOPLE, ONE THAT IS NOT
SUBJECT TO INFLATIONARY MOVES BY A
CENTRAL BANK
CRYPTOCURRENCY IS AN
ATTEMPT TO BRING BACK
What does this simply mean? A
DECENTRALISED CURRENCY OF
PEOPLE, ONE THAT IS NOT SUBJECT TO
INFLATIONARY MOVES BY A CENTRAL
BANK
No
Government
& other
Intervention
NEGATION
WHAT DOES THE MIDDLE
MEN DO?
LET’s TAKE EXAMPLE OF BANKS
PURPOSE OF BANK
PURPOSE OF BANK
IF THIS TRUST BY “BANK”
IS REPLACED WITH AN
“ALGORITHM”
More DETAILS an Investigator
KNOWS about the TECH
ARCHITECTURE, the CLOSER
he gets to CLOSE the CASE 2
FOR THE
UNversed
WHAT
IS
An Overall View……
BLOCK with
some DATA
1
BLOCK with
some DATA
1 2
1 2 3
1 2 3 4
1 2 3 4 5
1 2 3 4 5
6
1 2 3 4 5
7 6
1 2 3 4 5
8 7 6
1 2 3 4 5
9 8 7 6
1 2 3 4 5
10 9 8 7 6
1 2 3 4 5
10 9 8 7 6
11
1 2 3 4 5
10 9 8 7 6
11 12
1 2 3 4 5
10 9 8 7 6
11 12 13
1 2 3 4 5
10 9 8 7 6
11 12 13 14
1 2 3 4 5
10 9 8 7 6
11 12 13 14 15
1 2 3 4 5
10 9 8 7 6
11 12 13 14 15
1 2 3 4 5
10 9 8 7 6
11 12 13 14 15
1 2 3 4 5
10 9 8 7 6
11 12 13 14 15
1 2 3 4 5
10 9 8 7 6
11 12 13 14 15
1 2 3 4 5
10 9 8 7 6
11 12 13 14 15
1 2 3 4 5
10 9 8 7 6
….Mathematically connected
11 12 13 14 15
1 2 3 4 5
….Mathematically connected
11 12 13 14 15
Trust | Third party Negation |Hash Cash| Public Keys | Private Keys | y2 = x3 + 7 | RIPEMD-160 | SHA-256 |
Finite Fields | Secp256k1 standard | Distributed Ledger | 03 Jan 2009 | Satoshi Nakamoto | ASIC | Mining |
Proof of work | Consensus | ECDSA| Prime Numbers| Immutability | Cryptography | Transactions | Wallets
| Wallet file | data extraction | Linux system | Bitcoin Core | Bitcoin Scripts | Bloom filters | BIP0037 Bloom
filters | Getting Merkle blocks | getting transactions of interest | Using multiple hash functions | Gossip
Protocol | GPU |FPGA | The transaction lifecycle | The transaction data structures | Types of scripts |
Coinbase transactions | Transaction validations |Transaction bugs | Difficulty adjustment and retargeting
algorithms | Kimoto Gravity Well Difficulty adjustment and retargeting algorithms | Kimoto Gravity Well |
Dark Gravity Wave | Bitcoin limitations | Privacy and anonymity | Extended protocols on top of Bitcoin
|Colored coins | Hashing algorithms | Difficulty adjustment algorithms | Inter-block time | Block rewards |
Reward halving rate |Block size and transaction size | Dark Gravity Wave| DigiShield | Difficulty adjustment
algorithms | Inter-block time | Block rewards | Reward halving rate | Block size and transaction size | Bitcoin
Development Environment | Compiling Bitcoin Core from the Source Code | Selecting a Bitcoin Core Release
| Configuring the Bitcoin Core Build | Building the Bitcoin Core Executables | Running a Bitcoin Core Node |
Running Bitcoin Core for the First Time | Configuring the Bitcoin Core Node |Bitcoin Core Application
Programming Interface (API) | Getting Information on the Bitcoin Core Client Status | Exploring and
Decoding Transactions | Exploring Blocks | Using Bitcoin Core’s Programmatic Interface | Advanced
Transactions and Scripting | Multisignature | Pay-to-Script-Hash (P2SH) | P2SH Addresses | Benefits of P2SH
| Redeem Script and Validation | Data Recording Output (RETURN) | Timelocks | Transaction Locktime
(nLocktime) | Check Lock Time Verify (CLTV) | Relative Timelocks | Relative Timelocks with nSequence |
Relative Timelocks with CSV | Median-Time-Past | Timelock Defense Against Fee Sniping | Scripts with Flow
TRADITIONAL WAY OF SHARING
DOCUMENTS
TRADITIONAL WAY OF SHARING
DOCUMENTS
TRADITIONAL WAY OF SHARING
DOCUMENTS
Word document
TRADITIONAL WAY OF SHARING
DOCUMENTS
LOCAL LAN
Word document
TRADITIONAL WAY OF SHARING
DOCUMENTS
Word document
TRADITIONAL WAY OF SHARING
DOCUMENTS
Word document
TRADITIONAL WAY OF SHARING
DOCUMENTS
Word document
IF SUFFICIENT BANDWIDTH NOT
AVAILABLE, SERVER CRASHES
SD
CENTRALISED
SD
CENTRALISED DE-CENTRALISED
SD
ASDASDASDASD
CENTRALISED DE-CENTRALISED DISTRIBUTED
SD
SD
ASDASDASDASD
ASDASDASDASD
SD
SD
Word document
EVERY NODE
MAINTAINS A LOCAL
COPY
Word document
SD
SD
Word document
EVERY NODE
MAINTAINS A LOCAL
COPY
ALL THE COPIES ARE
IDENTICAL
Word document
SD
Word document
EVERY NODE
MAINTAINS A LOCAL
COPY
ALL THE COPIES ARE
IDENTICAL
C
A B
C
D
A B
PUBLIC PUBLIC
LEDGER Rs 1000/- LEDGER Rs 1000/-
C D
PUBLIC Rs 1000/- PUBLIC
Rs 1000/-
LEDGER LEDGER
Note : ‘Rs’ here is just a denoting currency, while in Bitcoin network it is JUST a tokens
A B
PUBLIC PUBLIC
Rs 1000/- Rs 1000/-
LEDGER Rs 200/- LEDGER
C D
PUBLIC Rs 1000/- PUBLIC
Rs 1000/-
LEDGER LEDGER
Note : ‘Rs’ here is just a denoting currency, while in Bitcoin network it is JUST a tokens
A B
PUBLIC PUBLIC
Rs 1000/- Rs 1000/-
LEDGER Rs 200/- LEDGER
A>B Rs 200 A>B Rs 200
C D
PUBLIC Rs 1000/- PUBLIC
Rs 1000/-
LEDGER LEDGER
A>B Rs 200 A>B Rs 200
Note : ‘Rs’ here is just a denoting currency, while in Bitcoin network it is JUST a tokens
A B
PUBLIC PUBLIC
Rs 1000/- Rs 1000/-
LEDGER Rs 200/- LEDGER
A>B Rs 200 A>B Rs 200
Rs 600/-
C D
PUBLIC Rs 1000/- PUBLIC
Rs 1000/-
LEDGER LEDGER
A>B Rs 200 A>B Rs 200
Note : ‘Rs’ here is just a denoting currency, while in Bitcoin network it is JUST a tokens
A B
PUBLIC PUBLIC
Rs 1000/- Rs 1000/-
LEDGER Rs 200/- LEDGER
A>B Rs 200 A>B Rs 200
B>D Rs 600 B>D Rs 600
Rs 600/-
C D
PUBLIC Rs 1000/- PUBLIC
Rs 1000/-
LEDGER LEDGER
A>B Rs 200 A>B Rs 200
B>D6 Rs 600 B>D Rs 600
Note : ‘Rs’ here is just a denoting currency, while in Bitcoin network it is JUST a tokens
A B
PUBLIC PUBLIC
Rs 1000/- Rs 1000/-
LEDGER Rs 200/- LEDGER
A>B Rs 200 A>B Rs 200
B>D Rs 600 B>D Rs 600
Rs 10000/-
Rs 600/-
C D
PUBLIC Rs 1000/- PUBLIC
Rs 1000/-
LEDGER LEDGER
A>B Rs 200 A>B Rs 200
B>D6 Rs 600 B>D Rs 600
Note : ‘Rs’ here is just a denoting currency, while in Bitcoin network it is JUST a tokens
A B
D
E
A B
F
I
C
G
D
E
A B
H
J
F K
I
C
G
D
L
E
A B
H
J
F K
I
C
G
D
L
E
A B
H
J
F K
I
C
G
D
L
E
A B
H
J
F K
I
C
G
D
L
All the participants are GEOGRAPHICALLY LOCATED
APART in a boundary less CYBER WORLD
Rs 1000/-
A>B Rs 200
B>D Rs 600
C>B Rs 100
B>C Rs 200
A>B Rs 100
LEDGER
D>C Rs 189
MILLIONS OF
TRANSACTIONS
A>B Rs 100
C>D Rs 250
B>C Rs 170
D>C Rs 189
CONSENSUS
Proof of Stake(PoS) Equihash Proof of Work
PROOF OF WORK : Anyone can
participate in a permission less Delayed Proof Of Work(dPoW)
blockchain network. In order to index a Leased Proof of Stake(LPoS) Proof of Work-Ethereum- PoW Blockchain consensus refers
transaction in the block, the node(miner)
needs to solve a mathematical puzzle. PROOF OF STAKE PROOF OF WORK to the
Greedy Heaviest Observed Sub Tree Consensus(GHOST)
Delegated Proof of Stake(DPoS)
PROOF OF STAKE : Only those nodes
who have some coins or held stakes on
the blockchain can participate.
Proof of Authority(PoA)
Solida Reconfigurable Byzantine
Consensus
DECENTRALIZED PROCESS
Fantomette Consensus Cuckoo Cycle Algorithm ASIC
Proof of Work-Bitcoin- PoW resistant
PROOF OF BURN : Participants have to
show proof that they burned some coins HYBRID & OTHERS Tangarao
by which
by sending the same to a un-spendable Tendermint Consensus
Consensus
BLOCKCHAIN
address. Proof of Human Work(PoHW)
Yet Another
Proof of Familiarity(PoF) CONSENSUS Consensus(YAC)
Protocol for
Asynchronous Reliable
PARTICIPANTS IN A
DIRECT ACYCLIC GRAPH TANGLE :
Based on a network of interconnected Consensus algorithms enable
Hyperledger
Consensus
Secure & Efficient
Consensus (PARSEC) DISTRIBUTED NETWORK
nodes that grow in various directions
wherein each node confirms the two Proof of Burn participants in a network to Ripple
previous transactions. Consensus agree on the contents in a Consensus Hotstuff Consensus
Proof of Elapsed
PROOF OF BURN
trustless
manner
and distributed
BFT BASED AGREE
consensus mechanisms where two or Practical Byzantine Fault
more existing consensus algorithms are Tolerance
combined to reach a decision. Consensus(PBFT)
Hashgraph Consensus
Proof of
Kafka
Iroha
on the VALIDITY OF
Consensus
PROOF OF CAPACITY : Refers to a
Serialization of Proof of Work
Events Confirming Transactions Via
Capacity(PoC)
Ouroboros
Consensus
TRANSACTIONS
consensus which is attained by Omni-ledger
Recursive Elections(SPECTRE) Consensus
participating nodes when they show Consensus
interest in the service by allocating a
trivial memory or storage space to solve
a given challenge. DIRECT ACYCLIC GRAPH
PROOF
CAPACITY
OF
Stellar
PaLa
Consensus
and the current state of the
Consensus
TANGLE
ledger
CORDA Consensus) Proof of Importance(PoI) Asynchronous BFT
BYZANTINE FAULT TOLERANT : Consensus
Refers to a system which tolerates
failures that belong to the Byzantine
general problem and work till such time Proof of Believability(PoB) Sumeragi
Raiblocks Consensus) Consensus Exonum
the traitors do not exceed 1/3rd of the
generals. Consensus
So by & large, any
blockchain rides
majorly on
CRYPTOGRAPHY
QUANTUM TECHNOLOGIES
Vs
Quantum Cryptography
CLASSICAL CRYPTOGRAPHY
CLASSICAL CRYPTOGRAPHY
PETER SHOR ALGORITHM
LUV GROVER ALGORITHM
CRYPTOGRAPHICALLY
RELEVANT QUANTUM
COMPUTER
Prime Factorization
Early 1970s
Discrete Logarithm
1970-1980s
CLASSICAL
Elliptic Curve
CRYPTOGRAPHY
Discrete Logarithm
1985
CRQC
Entanglement (1935)
QKD (1984)
Superposition(1926)
Quantum Mechanics
(1900)
INDIGENOUS CRYPTOGRPAHY ???
Quantum Computing CONCEPTS
Quantum Mechanics
QUANTUM TECHNOLOGIES
Superposition
Theta (θ): The angle from the north pole (0) to the
point on the sphere.
Phi (φ): The angle around the z-axis of the sphere.
Entanglement
What it is?
Quantum Internet
QKD: Used for secure communication, with some governments and companies
deploying it in small-scale networks (e.g., China's quantum satellite).
• Relies on the fact that any attempt to eavesdrop on the key exchange will
disturb the system, making it detectable.
QRNG
Uses the principles of quantum mechanics to create random numbers. Unlike
traditional methods, which rely on algorithms to generate numbers, QRNG
generates truly random numbers based on the unpredictable behavior of
quantum particles, like photons.
PQC
PQC
Problem Description
Lattice Relies on the difficulty of solving problems on mathematical lattices, offering
resistance against quantum attacks. Examples include ML-KEM and ML-DSA.
Hash Uses cryptographic hash functions as the foundation, providing security based on
the properties of these functions. SLH-DSA is an example
Isogeny Exploits the properties of isogenies between elliptic curves. SIKE (Supersingular
Isogeny Key Encapsulation) was a candidate, but has been broken.
PQC (USA NIST Standards)
CHINA
RUSSIA
Imminence of Post-Quantum
Blockchains
Quantum Algorithm Zoo
https://quantumalgorithmzoo.org/
RARE EARTH
PQC MIGRATION
Let’s Discuss
Each time the AI uses a data point, it "spends" a bit of that privacy credit
DIFFERENTIALLY PRIVATE SYNTHETIC
DATA
“Chinese defense experts emphasize the need
to develop learning algorithms for small
samples, including through the Bayesian
program learning method and Transfer
Learning, or using Extant Samples to solve
problems in similar fields”
Bayesian Program Learning (BPL)
Focus: BPL aims to "learn how to learn" from small datasets. It focuses on
identifying the underlying structure or program that generated the data, rather
than just memorizing specific examples.
Benefits: This approach can help avoid overfitting and potentially lead to
more generalizable models, even with limited data.
INFO CALYPSE
EIDETIC MEMORISATION
GLLMMMs
GLLMMMs
Generative Large Language Multimodal
Models
GLLMMMs
Generative Large Language Multimodal
Models
Concept involves combining multiple types of data (e.g., Text,
images, audio) into a single AI model.
SINGULARITY
AGI
AUTONOMOUS SYSTEMS
SUPERINTELLIGENT AI
The event when AI progress becomes uncontrollable and leads to
Singularity
unpredictable changes.
The goal is to make the student model faster and lighter, while
keeping most of the teacher’s performance and "knowledge.
FMRI + AI
MACHINE UNLEARNING
HARDWARE BIAS IN AI
HARDWARE TROJANS: AI CONTEXT
BENCHMARKING
FI SCORE
GOOGLE NAPTIME
TRUTHFULQA BENCHMARK OF
TRUTHFULNESS
HOTPOTQA
TABULA RASA AI
JAIL BREAKING LLM
It’s like tricking the AI into "breaking out" of its ethical or policy
boundaries.
PROMPT ENGINEERING
FEDERATED LEARNING
FACEBOOK CHATBOTS LANGUAGE
MISCELLANEOUS : BUT IMPORTANT
DNA PHENOTYPING
DOOM SCROLLING / SCROLL HOLE
National Wastage
WATER PER PROCESSOR/CHIP
NEUROMORPHIC COMPUTING
HOMOMORPHIC ENCRYPTION
ZERO TRUST ARCHITECTURE
Several technical aspects contribute to green coding:
GREEN CODING
Power management: power-saving features in software, such as
sleep modes, hibernation, and dynamic power scaling.
Data compression:.
Virtualization:
Renewable energy:
Primary goal of green coding is to reduce the carbon There are various tools and frameworks that can support green
coding practices:
footprint associated with software development and its lifecycle.
Code analysis tools
This includes: Energy profiling tools
Cloud management tools
Energy conservation
Sustainability frameworks
Code Profiling
Resource optimization It involves measuring the execution time, memory usage, and other
performance metrics of different code sections.
Waste reduction
Code Refactoring
Promoting sustainability
To improve the code's structure and readability without changing its
external behaviour. It's about making code cleaner, more
maintainable, and often more efficient.
Types:
o Machine-independent optimizations:
o Machine-dependent optimizations
Transformer
• AI model architecture introduced in 2017, designed to handle sequences using
attention mechanisms.
• It’s the foundation of models like GPT and many other modern AI systems.
2047
SURAKSHIT BHARAT
SONE KI CHIDIYA
SONE KI CHIDIYA
TECHNOLOGICAL SLAVERY
The ILLITERATE of the st
21 century
will not be those who cannot
Read and Write, but those who
cannot
Learn, Unlearn, and Relearn
WE ARE LIKELY TO SEE 2-3 PHASES OF
FUTURES
Jai Hind
[email protected]
youtube.com/@bnab