August 30, 2025 – Philadelphia















A structured, in-depth study guide to the 2-hour conversation. Organized for fast review and long-term study.
Core thesis: Winogrand insists that photographs are not narratives or opinions in words; they are records of what a piece of time and space looked like to a camera. The photographer’s job is to make pictures that are more dramatic (more compelling) than the thing photographed—without loading the frame with self-conscious “artiness.”
“They show you what a piece of time and space looked like to a camera.”
“The work has to be more dramatic than what was photographed.”
“I would like not to exist [in the picture].”
Walker Evans — “Transparent”
“Evans… is as close to the absence of a strategy as I know of.”
Robert Frank — Casual Strategy
“The picture I made was made; the picture he made happened.”
Edward Weston — “Arty”
Bottom line: Arty vs. anti-arty are both strategies; Evans is exceptional for minimizing the sense of strategy while maintaining an unmistakable voice.
“You’re not a camera… You don’t see the way a camera sees.”
“They function like puns… They make you question what you think you know.”
“How do you make a photograph that is more dramatic than what was photographed? That’s the problem.”
“The tools you use are responsible for how the pictures look.”
“I don’t want to buy all that mechanism I don’t use.”
Working rule of thumb:
“It depends on what kind of murder you can get away with.”
“If I had to pick 20 today, 10 would be different tomorrow.”
“Only be edited by my equals… otherwise pay a fortune.”
“You don’t learn from teachers. You learn from work.”
“The camera doesn’t know what you understand… your understanding may catch up with a frame.”
Classroom ethic: If he says something you can’t see in the picture, nail him—“If it isn’t physical, it’s rhetoric.”
“Sander was making a catalog… Avedon is absolutely interested in these people as people.”
*(Note: His critique of Bruce Davidson’s *East 100th Street* is extremely harsh—he argues it reflects condescending liberal stereotypes. Summarized here without repeating harmful phrasing.)*
“I photograph where I am.”
“I would like not to exist.”
“Evans… is as close to the absence of a strategy as I know.”
“The picture I made was made; the picture he made happened.”
“It’s only pictures we’re getting.”
“Technique is easy… You learn from work.”
“If I had to pick 20 today, 10 would be different tomorrow.”
“Only be edited by my equals; otherwise pay a fortune.”
“If I say something you don’t see in the picture, nail me… If it isn’t physical, it’s rhetoric.”
Q: Do you strive to be transparent?
“I’d like not to exist… In the end, all I can do is wrestle and whatever comes out.”
Q: Are Leicas archaic vs. auto SLRs?
Calls that “stupid”; with small lenses, SLRs force focusing aids and push design; prefers rangefinders’ simplicity.
Q: Why call your early rodeo frames ‘junk action’?
Relative to the arena photographers’ peak moments; his access/lens limited him—different problem, different pictures.
Q: Are photos ambiguous?
They’re specific yet can’t settle narrative facts; they work like puns, upsetting assumptions.
Q: Are you a bad editor?
“Horse****.” Also: he *defers to equals* (Papageorge) and accepts that selections shift.
Q: Teaching value?
Still interesting because he’s still learning how to talk about pictures; but learning comes from work.

The source is below, but it stretches above,
Roots planted in the ground, yet flying like a dove.
A good fountain must be dug deep underground,
Through suffering and strife, the living God is found.
When it’s connected to the source it can endlessly feed others,
Even the hounds, the lost, and the brothers.
Playing in the garden, just you and some trees,
Trimming the weeds, getting stung by the bees.
Riding tigers through the forest, freedom everlasting,
When you pick up the flaming swords, and you start fasting.
You can ascend the material plane, return to Paradise,
For it has not been lost — it’s always been inside.
Somebody may strike you, knock you on the chin,
But you turn the other cheek, maybe even grin.
Because love comes from above, and you need not sin,
Laughing in the face of chaos, floating through the unknown,
Nothing can break your spirit, for you’re never alone.
For God is love, the divine source,
We’re all created in His image, set on this course.
But the world turns us astray —
Hatred, bitterness, greed etched on the face,
We consume until we grow fat, our bones give way.
Our bodies six feet under will return to the clay,
But while you’re here on this earth, be a child and play.
The smoke screens, distractions, the clamor, the noise,
May pollute your body, may steal your joys.
But like a good gardener, pruning what’s dead,
New growth will spring forth, fresh life instead.
Good fruits from the vine — you shine with true joy,
For your connection to Him they can never destroy.
Download full video lecture here:

What’s poppin’ people?
It’s Dante — walking outside of City Hall here in the city of brotherly love, Philadelphia.
Today I’m thinking about something deeper than the bricks and fountains around me.
I’m thinking about divine love.
There’s this ancient idea called agape love — a kind of unconditional, divine love. I first came across it while reading Plato’s Symposium, but it didn’t really come alive for me until I experienced it myself.
Through living. Through witnessing.
Let me take you back.
When I was a Peace Corps volunteer in Zambia, I saw something that changed me.
In the village, everyone had a role:
Everyone was making a daily sacrifice.
And at the center of it all? A well.
Every morning, the whole community gathered at that well. It wasn’t just about water — it was life. It was unity. It was love in motion.
Looking at the flowing fountain here in Philly, I remembered that well.
In order to construct a well, you must connect to the source.
You don’t just find water on the surface. You dig. Through dirt. Through pain. Through suffering. Through hell itself.
But once you hit the source, it flows endlessly.
And now — anyone can come to drink. The whole community thrives.
That’s divine love.
That’s what I believe we’re here to do.
And I’m pretty sure — I gotta double-check this — but the original plan for City Hall included a fountain in the center, a place for people to come and drink.
The symbolic heart of the city.
Because a city, just like a village, needs a well —
A source where life begins.
A center of nourishment.
A place of gathering.
And for me, that center… is love.
If your love comes from above — from God, from the source — then you don’t need love from the world.
You’re not out here seeking validation.
You’re not begging for someone to love you.
You’re not striving for approval.
You shine in the light of Christ.
You love effortlessly.
You give endlessly.
You expect nothing in return.
Because you’re full.
Back in Zambia, every weekend — every day, really — people gathered at the church.
They went to learn about Christ.
To embody Christ.
To love their neighbor.
And when one person in a tribe walks that path — when they embody divine love — the entire tribe benefits.
Everyone is nourished.
And it’s not just about food or water.
The real nourishment is from the spirit.
You don’t thrive by consuming the world.
You thrive by embodying love.
That’s the key. You’re not out here chasing love.
You’re not trying to possess it through relationships, titles, or success.
You are love.
Because God is love, and you were made in His image.
That’s where the power lies.
Your real strength isn’t in your biceps or your bone density.
It’s not in your grind or your bank account.
The real power is in the spirit.
And that’s what’s missing in modern society.
We’re addicted to pleasure, chasing wealth, faking love.
The antidote?
Be love.
Spread love.
Stop needing it from others.
When you’re tapped into God, nothing can break you.
You’re like a Spartan with Hoplite armor.
You’re like level 99 in Skyrim with Daedric armor and full defense stats.
Unstoppable.
Because you’re powered by something eternal.
And that’s divine love — the well that never runs dry.
When you connect to that source, you become the well.
Others can come to drink.
You nourish the world, not by taking, but by overflowing.
So tap in. Dig deep. Connect to the source.
That’s where life begins.
—Dante

https://bitcoin.org/bitcoin.pdf
Satoshi Nakamoto
satoshin@gmx.com
www.bitcoin.org
A purely peer-to-peer version of electronic cash would allow online payments to be sent directly from one party to another without going through a financial institution. Digital signatures provide part of the solution, but the main benefits are lost if a trusted third party is still required to prevent double-spending. This paper proposes a solution to the double-spending problem using a peer-to-peer network. The network timestamps transactions by hashing them into an ongoing chain of hash-based proof-of-work, forming a record that cannot be changed without redoing the proof-of-work. The longest chain serves as proof of the sequence of events witnessed and proof that it came from the largest pool of CPU power. As long as a majority of CPU power is controlled by nodes that are not cooperating to attack the network, they will generate the longest chain and outpace attackers. The network itself requires minimal structure. Messages are broadcast on a best effort basis, and nodes can leave and rejoin the network at will, accepting the longest proof-of-work chain as proof of what happened while they were gone.
Commerce on the Internet has come to rely almost exclusively on financial institutions serving as trusted third parties to process electronic payments. While the system works well enough for most transactions, it still suffers from the inherent weaknesses of the trust-based model. Completely non-reversible transactions are not really possible, since financial institutions cannot avoid mediating disputes. The cost of mediation increases transaction costs, limiting the minimum practical transaction size and cutting off the possibility for small casual transactions. There is a broader cost in the loss of the ability to make non-reversible payments for non-reversible services. With the possibility of reversal, the need for trust spreads. Merchants must be wary of their customers, hassling them for more information than they would otherwise need. A certain percentage of fraud is accepted as unavoidable. These costs and payment uncertainties can be avoided in person by using physical currency, but no mechanism exists to make payments over a communications channel without a trusted party.
What is needed is an electronic payment system based on cryptographic proof instead of trust, allowing any two willing parties to transact directly with each other without the need for a trusted third party. Transactions that are computationally impractical to reverse would protect sellers from fraud, and routine escrow mechanisms could easily be implemented to protect buyers. In this paper, we propose a solution to the double-spending problem using a peer-to-peer distributed timestamp server to generate computational proof of the chronological order of transactions. The system is secure as long as honest nodes collectively control more CPU power than any cooperating group of attacker nodes.
We define an electronic coin as a chain of digital signatures. Each owner transfers the coin to the next by digitally signing a hash of the previous transaction and the public key of the next owner and adding these to the end of the coin. A payee can verify the signatures to verify the chain of ownership.
The problem, of course, is that the payee can’t verify that one of the owners did not double-spend the coin. A common solution is to introduce a trusted central authority, or mint, that checks every transaction for double spending. After each transaction, the coin must be returned to the mint to issue a new coin, and only coins issued directly from the mint are trusted not to be double-spent. The problem with this solution is that the fate of the entire money system depends on the company running the mint, with every transaction having to go through them, just like a bank.
We need a way for the payee to know that the previous owners did not sign any earlier transactions. For our purposes, the earliest transaction is the one that counts, so we don’t care about later attempts to double-spend. The only way to confirm the absence of a transaction is to be aware of all transactions. In the mint-based model, the mint was aware of all transactions and decided which arrived first. To accomplish this without a trusted party, transactions must be publicly announced [1], and we need a system for participants to agree on a single history of the order in which they were received. The payee needs proof that at the time of each transaction, the majority of nodes agreed it was the first received.
The solution we propose begins with a timestamp server. A timestamp server works by taking a hash of a block of items to be timestamped and widely publishing the hash, such as in a newspaper or Usenet post [2-5]. The timestamp proves that the data must have existed at the time, obviously, in order to get into the hash. Each timestamp includes the previous timestamp in its hash, forming a chain, with each additional timestamp reinforcing the ones before it.
To implement a distributed timestamp server on a peer-to-peer basis, we will need to use a proof-of-work system similar to Adam Back’s Hashcash [6], rather than newspaper or Usenet posts. The proof-of-work involves scanning for a value that, when hashed, such as with SHA-256, the hash begins with a number of zero bits. The average work required is exponential in the number of zero bits required and can be verified by executing a single hash.
For our timestamp network, we implement the proof-of-work by incrementing a nonce in the block until a value is found that gives the block’s hash the required zero bits. Once the CPU effort has been expended to make it satisfy the proof-of-work, the block cannot be changed without redoing the work. As later blocks are chained after it, the work to change the block would include redoing all the blocks after it.
The proof-of-work also solves the problem of determining representation in majority decision-making. If the majority were based on one-IP-address-one-vote, it could be subverted by anyone able to allocate many IPs. Proof-of-work is essentially one-CPU-one-vote. The majority decision is represented by the longest chain, which has the greatest proof-of-work effort invested in it. If a majority of CPU power is controlled by honest nodes, the honest chain will grow the fastest and outpace any competing chains. To modify a past block, an attacker would have to redo the proof-of-work of the block and all blocks after it and then catch up with and surpass the work of the honest nodes. We will show later that the probability of a slower attacker catching up diminishes exponentially as subsequent blocks are added.
To compensate for increasing hardware speed and varying interest in running nodes over time, the proof-of-work difficulty is determined by a moving average targeting an average number of blocks per hour. If they’re generated too fast, the difficulty increases.
The steps to run the network are as follows:
Nodes always consider the longest chain to be the correct one and will keep working on extending it. If two nodes broadcast different versions of the next block simultaneously, some nodes may receive one or the other first. In that case, they work on the first one they received, but save the other branch in case it becomes longer. The tie will be broken when the next proof-of-work is found and one branch becomes longer; the nodes that were working on the other branch will then switch to the longer one.
New transaction broadcasts do not necessarily need to reach all nodes. As long as they reach many nodes, they will get into a block before long. Block broadcasts are also tolerant of dropped messages. If a node does not receive a block, it will request it when it receives the next block and realizes it missed one.
By convention, the first transaction in a block is a special transaction that starts a new coin owned by the creator of the block. This adds an incentive for nodes to support the network, and provides a way to initially distribute coins into circulation, since there is no central authority to issue them. The steady addition of a constant amount of new coins is analogous to gold miners expending resources to add gold to circulation. In our case, it is CPU time and electricity that is expended.
The incentive can also be funded with transaction fees. If the output value of a transaction is less than its input value, the difference is a transaction fee that is added to the incentive value of the block containing the transaction. Once a predetermined number of coins have entered circulation, the incentive can transition entirely to transaction fees and be completely inflation free.
The incentive may help encourage nodes to stay honest. If a greedy attacker is able to assemble more CPU power than all the honest nodes, he would have to choose between using it to defraud people by stealing back his payments or using it to generate new coins. He ought to find it more profitable to play by the rules, such rules that favour him with more new coins than everyone else combined, than to undermine the system and the validity of his own wealth.
Once the latest transaction in a coin is buried under enough blocks, the spent transactions before it can be discarded to save disk space. To facilitate this without breaking the block’s hash, transactions are hashed in a Merkle Tree [7][2][5], with only the root included in the block’s hash. Old blocks can then be compacted by stubbing off branches of the tree. The interior hashes do not need to be stored.
A block header with no transactions would be about 80 bytes. If we suppose blocks are generated every 10 minutes, 80 bytes * 6 * 24 * 365 = 4.2MB per year. With computer systems typically selling with 2GB of RAM as of 2008, and Moore’s Law predicting current growth of 1.2GB per year, storage should not be a problem even if the block headers must be kept in memory.
It is possible to verify payments without running a full network node. A user only needs to keep a copy of the block headers of the longest proof-of-work chain, which he can get by querying network nodes until he’s convinced he has the longest chain, and obtain the Merkle branch linking the transaction to the block it’s timestamped in. He can’t check the transaction for himself, but by linking it to a place in the chain, he can see that a network node has accepted it, and blocks added after it further confirm the network has accepted it.
As such, the verification is reliable as long as honest nodes control the network, but is more vulnerable if the network is overpowered by an attacker. While network nodes can verify transactions for themselves, the simplified method can be fooled by an attacker’s fabricated transactions for as long as the attacker can continue to overpower the network. One strategy to protect against this would be to accept alerts from network nodes when they detect an invalid block, prompting the user’s software to download the full block and alerted transactions to confirm the inconsistency. Businesses that receive frequent payments will probably still want to run their own nodes for more independent security and quicker verification.
Although it would be possible to handle coins individually, it would be unwieldy to make a separate transaction for every cent in a transfer. To allow value to be split and combined, transactions contain multiple inputs and outputs. Normally there will be either a single input from a larger previous transaction or multiple inputs combining smaller amounts, and at most two outputs: one for the payment, and one returning the change, if any, back to the sender.
It should be noted that fan-out, where a transaction depends on several transactions, and those transactions depend on many more, is not a problem here. There is never the need to extract a complete standalone copy of a transaction’s history.
The traditional banking model achieves a level of privacy by limiting access to information to the parties involved and the trusted third party. The necessity to announce all transactions publicly precludes this method, but privacy can still be maintained by breaking the flow of information in another place: by keeping public keys anonymous. The public can see that someone is sending an amount to someone else, but without information linking the transaction to anyone. This is similar to the level of information released by stock exchanges, where the time and size of individual trades, the “tape”, is made public, but without telling who the parties were.
As an additional firewall, a new key pair should be used for each transaction to keep them from being linked to a common owner. Some linking is still unavoidable with multi-input transactions, which necessarily reveal that their inputs were owned by the same owner. The risk is that if the owner of a key is revealed, linking could reveal other transactions that belonged to the same owner.
We consider the scenario of an attacker trying to generate an alternate chain faster than the honest chain. Even if this is accomplished, it does not throw the system open to arbitrary changes, such as creating value out of thin air or taking money that never belonged to the attacker. Nodes are not going to accept an invalid transaction as payment, and honest nodes will never accept a block containing them. An attacker can only try to change one of his own transactions to take back money he recently spent.
The race between the honest chain and an attacker chain can be characterized as a Binomial Random Walk. The success event is the honest chain being extended by one block, increasing its lead by +1, and the failure event is the attacker’s chain being extended by one block, reducing the gap by -1.
The probability of an attacker catching up from a given deficit is analogous to a Gambler’s Ruin problem. Suppose a gambler with unlimited credit starts at a deficit and plays potentially an infinite number of trials to try to reach breakeven. We can calculate the probability he ever reaches breakeven, or that an attacker ever catches up with the honest chain, as follows [8]:
qz = { 1 if p ≤ q
(q/p)^z if p > q }
Given our assumption that p > q, the probability drops exponentially as the number of blocks the attacker has to catch up with increases. With the odds against him, if he doesn’t make a lucky lunge forward early on, his chances become vanishingly small as he falls further behind.
We now consider how long the recipient of a new transaction needs to wait before being sufficiently certain the sender can’t change the transaction. We assume the sender is an attacker who wants to make the recipient believe he paid him for a while, then switch it to pay back to himself after some time has passed. The receiver will be alerted when that happens, but the sender hopes it will be too late.
The receiver generates a new key pair and gives the public key to the sender shortly before signing. This prevents the sender from preparing a chain of blocks ahead of time by working on it continuously until he is lucky enough to get far enough ahead, then executing the transaction at that moment. Once the transaction is sent, the dishonest sender starts working in secret on a parallel chain containing an alternate version of his transaction.
The recipient waits until the transaction has been added to a block and z blocks have been linked after it. He doesn’t know the exact amount of progress the attacker has made, but assuming the honest blocks took the average expected time per block, the attacker’s potential progress will be a Poisson distribution with expected value:
λ = z * (q/p)
To get the probability the attacker could still catch up now, we multiply the Poisson density for each amount of progress he could have made by the probability he could catch up from that point:
Σ from k=0 to ∞ λ^k * e^-λ / k! * { (q/p)^(z-k) if k ≤ z
1 if k > z }
Rearranging to avoid summing the infinite tail of the distribution…
1 – Σ from k=0 to z λ^k * e^-λ / k! * (1 – (q/p)^(z-k))
Converting to C code…
“`c
double AttackerSuccessProbability(double q, int z)
{
double p = 1.0 – q;
double lambda = z * (q / p);
double sum = 1.0;
int i, k;
for (k = 0; k <= z; k++)
{
double poisson = exp(-lambda);
for (i = 1; i <= k; i++)
poisson *= lambda / i;
sum -= poisson * (1 – pow(q / p, z – k));
}
return sum;
}
Running some results, we can see the probability drop off exponentially with z.
q=0.1
z=0 P=1.0000000
z=1 P=0.2045873
z=2 P=0.0509779
z=3 P=0.0131722
z=4 P=0.0034552
z=5 P=0.0009137
z=6 P=0.0002428
z=7 P=0.0000647
z=8 P=0.0000173
z=9 P=0.0000046
z=10 P=0.0000012
q=0.3
z=0 P=1.0000000
z=5 P=0.1773523
z=10 P=0.0416605
z=15 P=0.0101008
z=20 P=0.0024804
z=25 P=0.0006132
z=30 P=0.0001522
z=35 P=0.0000379
z=40 P=0.0000095
z=45 P=0.0000024
z=50 P=0.0000006
Solving for P less than 0.1%…
P < 0.001
q=0.10 z=5
q=0.15 z=8
q=0.20 z=11
q=0.25 z=15
q=0.30 z=24
q=0.35 z=41
q=0.40 z=89
q=0.45 z=340
We have proposed a system for electronic transactions without relying on trust. We started with the usual framework of coins made from digital signatures, which provides strong control of ownership, but is incomplete without a way to prevent double-spending. To solve this, we proposed a peer-to-peer network using proof-of-work to record a public history of transactions that quickly becomes computationally impractical for an attacker to change if honest nodes control a majority of CPU power.
The network is robust in its unstructured simplicity. Nodes work all at once with little coordination. They do not need to be identified, since messages are not routed to any particular place and only need to be delivered on a best effort basis. Nodes can leave and rejoin the network at will, accepting the proof-of-work chain as proof of what happened while they were gone. They vote with their CPU power, expressing their acceptance of valid blocks by working on extending them and rejecting invalid blocks by refusing to work on them. Any needed rules and incentives can be enforced with this consensus mechanism.

The Lightning Network was proposed by Joseph Poon and Thaddeus Dryja (2016) as a solution to Bitcoin’s scalability limits.
Bitcoin can only process ~7 transactions per second, far below the capacity of Visa (~47,000 tps). Increasing block size would lead to centralization, high fees, and reduced security. The Lightning Network addresses this by moving most transactions off-chain while retaining Bitcoin’s trustless, decentralized security model oai_citation:0‡lightning-network-paper.pdf.
Instead of broadcasting every transaction globally, two parties can open a micropayment channel:
This allows billions of off-chain payments per day with minimal fees.
Channels aren’t just one-way:
A single channel only connects two users. But a network of interconnected channels allows payments to be routed across multiple hops:
HTLCs enable multi-hop routing:
The Lightning Network is not a separate coin or trusted overlay. It is Bitcoin transactions, enforced by Bitcoin’s blockchain, but conducted off-chain until necessary.
It allows:
Lightning represents the path for Bitcoin to handle global financial volume, from large settlements to tiny micropayments, without compromising its principles oai_citation:1‡lightning-network-paper.pdf.

The food pyramid wasn’t built on science. It was built on subsidies.
It’s fiat food.
The original U.S. food pyramid (1992) placed bread, pasta, rice, and cereal at the base, recommending 6–11 servings per day. Meat and fat were pushed to the very top with the message: “Eat sparingly.”
Why? Not because the science proved it. It was because government subsidies heavily supported corn, wheat, and soy. The pyramid was designed around what was cheap and profitable for industry, not what was biologically optimal for humans.
When people are encouraged to base their diet on refined grains and sugar, they don’t feel full for long. These foods spike insulin, crash blood sugar, and lead to constant cravings.
A population addicted to cheap carbs is a population that keeps buying more food.
And as health declines, the same population keeps buying more medicine.
A nation that eats fiat food becomes a nation of endless consumers—of snacks, of sodas, and eventually, of pharmaceuticals.
Since the release of the food pyramid in the 1990s, rates of obesity, diabetes, and heart disease have exploded.
The pyramid didn’t cure illness—it fueled industries that profit from it.
At the very top of the pyramid, meat and animal products were labeled “sparingly.” But this is the inversion of reality.
Meat is satiating. It provides complete proteins, essential vitamins, and nutrient density without the insulin rollercoaster. When you eat steak, eggs, or fish, you’re satisfied for hours, not craving another snack.
Meat makes you healthier and stronger. It builds muscle, supports hormone health, and gives the body the tools to thrive. By contrast, refined carbs and seed oils leave the body inflamed and weak.
Meat makes you less of a consumer. If you’re full and healthy, you don’t keep buying processed snacks, sugary drinks, or endless medications. You step outside the cycle of manufactured dependence.
The food pyramid is not a neutral guide. It is a blueprint for dependency. It keeps people sick, overweight, and in need of constant consumption.
Flip the pyramid, and you flip the script.
Base your diet on real foods—meat, eggs, butter, fish—and watch what happens:
In a world of fiat food and fiat health, the path to sovereignty starts on your plate.
I thank God every day for my solitude. Thank you Lord for setting me apart in a walled garden for me to play and be a big kid throughout my days.

Traveling is one of those things that completely transformed my life. If you’ve never left your hometown, your state, or your country, you have a limited perception of reality. When you travel to a new place, not only do you have the opportunity to experience something novel, but you also have the ability to adapt, to grow, to change, and ultimately to make new work through your photographs.
The countless experiences I’ve had from traveling have been the most fulfilling aspects of my journey as a photographer. There’s no amount of physical things or possessions you can purchase to improve, but the one thing you can do is buy plane tickets, train tickets, and explore the open world.
If there’s one thing about photography that keeps me excited about life, it’s the excuse and ability to go out into the world and explore endlessly. I know there is so much to do, to see, to explore, and to photograph in my lifetime. You could live until you’re 120 years old and still not see every corner of this earth. Is that not exciting? The mystery of the unknown is where we thrive as photographers. To embrace it openly, to throw yourself into the chaos, is where the trial by fire begins.
When I first arrived in Jerusalem, in the Old City back in 2017, I began to take my photography more seriously through traveling. I had to adapt and learn how to engage with new cultures through language barriers. I carried around an Instax camera and gifted strangers prints on the streets.
I started to explore unfamiliar territory—traveling from Jerusalem to the West Bank, throughout Ramallah, Jericho, Nablus, Qalandia, Jenin, Hebron, Bethlehem, and more. Through those trips, I learned how to engage in places unknown to me.
One day in Jericho, fires were rising and conflict was breaking out near the checkpoint. I couldn’t make it past the border, so I asked a Palestinian man to drive me as close as possible. I sprinted through the desert and made it to the frontlines of the conflict. At that moment, I made one of my strongest photos. But that image only came because I took a risk—embracing danger and the unknown openly.
The best photos come through exploring the unknown, embracing danger, and following through with courage. Traveling will test your courage and strengthen you as an artist. The more you go out there, practice courage, and follow your curiosity, the better your photographs will become.
This is why traveling is the most important thing a photographer can do. It teaches you how to exude courage and overcome anything that comes your way. If you can learn how to photograph in an unfamiliar place that challenges you, eventually you’ll be able to photograph in any situation you find yourself in.
If you’re still early in your journey—or even late in the game—and you haven’t yet explored the world, this is your call to take action. The sooner you do it, the better, and the faster your photography will improve.

Aldous Huxley’s Brave New World (1932) is a dystopian novel that envisions a future society built on technological control, consumerism, and engineered happiness. Unlike Orwell’s 1984, which relies on fear and repression, Huxley’s world maintains stability by providing pleasure, distraction, and conformity. It raises timeless questions about freedom, individuality, and what it means to be human.
The novel is set in the World State, a unified global government that eradicated war and suffering by sacrificing individuality and free will. Society is guided by the motto:
“Community, Identity, Stability.”
Huxley warns of a future where technology eliminates individuality. Efficiency and control replace creativity and free will.
The World State provides comfort at the cost of freedom. The question lingers: is happiness without freedom true happiness?
Endless entertainment, casual sex, and soma keep people docile. Huxley critiques modern tendencies toward distraction and shallow pleasure.
John argues that suffering is essential to the human condition. To deny it is to deny meaning and growth.
Religion is outlawed, replaced by worship of science and technology. John’s faith and longing for something higher clash with the sterile world.
Brave New World endures because it challenges us to reflect on modern society’s obsession with comfort, entertainment, and consumption. Huxley’s vision reminds us that to be human is to embrace both joy and suffering, freedom and responsibility.
The novel ultimately leaves us with a haunting paradox:
A world without pain may also be a world without meaning.