Start free trial
Trending New Genres Authors
EnglishEnglish
EspañolSpanish
简体中文Chinese
繁體中文Chinese (Traditional)
FrançaisFrench
DeutschGerman
日本語Japanese
PortuguêsPortuguese
ItalianoItalian
한국어Korean
РусскийRussian
NederlandsDutch
العربيةArabic
PolskiPolish
हिन्दीHindi
Tiếng ViệtVietnamese
SvenskaSwedish
ΕλληνικάGreek
TürkçeTurkish
ไทยThai
ČeštinaCzech
RomânăRomanian
MagyarHungarian
УкраїнськаUkrainian
IndonesiaIndonesian
DanskDanish
SuomiFinnish
БългарскиBulgarian
עבריתHebrew
NorskNorwegian
HrvatskiCroatian
CatalàCatalan
SlovenčinaSlovak
LietuviųLithuanian
SlovenščinaSlovenian
СрпскиSerbian
EestiEstonian
LatviešuLatvian
فارسیPersian
മലയാളംMalayalam
தமிழ்Tamil
اردوUrdu
Searching...
SoBrief
The Ethical Algorithm

The Ethical Algorithm

The Science of Socially Aware Algorithm Design
Algorithms can be fair, private, or accurate. The hard part is deciding what to sacrifice.
by Michael Kearns 2019 230 pages
4.10
500+ ratings
Listen
Immersive
V2.3
Amazon Kindle Audible
Try Full Access for 3 Days
Unlock listening & more!
Continue

Key Takeaways

Build ethical constraints into the objective, because optimization obeys what you specify.

Models follow the target. A machine-learning system can be built by a simple procedure that searches for a model that performs well on its assigned goal. The resulting model may still behave in surprising ways, because complex data and many possible models can produce patterns its designers did not anticipate. A system asked only to maximize predictive accuracy has no reason to protect privacy or treat groups fairly unless those requirements are also specified.

The book’s central proposal is to make social requirements measurable and incorporate them into algorithm design as constraints. For example, a navigation app directed people toward roads free of traffic during California wildfires, although those roads were dangerous. The app optimized travel time, not safety. Better objectives can reduce such failures, but the choice of values and acceptable trade-offs belongs to people.

Analysis

What's striking is how ordinary this failure mode is: the system does not need malice, only a narrow target and enough power to pursue it. This resembles Goodhart's law, the observation that a useful measure can become a poor guide once it is optimized directly. The book’s contribution is to move from warning about that trap toward specifying constraints that can be tested. Still, no objective captures every social consequence. Formal guarantees are strongest when paired with monitoring for harms the designers did not know to measure.

Treat anonymized records as linkable, not safe by default.

Small clues identify people. Massachusetts officials removed names from medical records but left birthdate, sex, and ZIP code. Researcher Latanya Sweeney combined those fields with a voter registry to identify Governor William Weld’s record. Her estimate was that 87 percent of the US population could be uniquely identified by that combination. Netflix removed names and demographic information from movie ratings, yet researchers found that six approximate movie ratings could identify a subscriber 99 percent of the time.

One attempted safeguard, k-anonymity, hides or coarsens details so each released record resembles at least k people. But resemblance does not hide sensitive facts when the group shares them, and separate releases can be combined to expose what each seemed to protect. Once data is published, future linking sources are hard to predict and the release cannot reliably be recalled.

Analysis

The deeper lesson is that anonymity is not a property of a file in isolation. It depends on what other information exists, what can be inferred from it, and what may become available later. This is why a dataset that looks harmless to its publisher can become revealing in combination with public records or online behavior. The practical implication is to scrutinize the whole data ecosystem, not merely remove direct identifiers. Even that approach has limits: sometimes the safer choice is not to collect or release a sensitive dataset at all.

Use differential privacy to limit what one person's record can change.

Protect each contribution. Differential privacy is a mathematical guarantee that an analysis behaves similarly whether one person’s record is included or removed. Its privacy parameter controls how much that person can affect the odds of any result. In the book’s example, a parameter of 2 limits an outcome to being at most twice as likely with a person’s data than without it.

Randomized response shows the basic idea: survey respondents sometimes answer truthfully and sometimes give a random answer. Each response is hard to interpret, but the pollster can estimate a population pattern from many responses. Privacy has a price: stricter protection generally requires more data or accepts less accurate estimates. The guarantee composes across multiple analyses, but it does not hide truths that can be inferred from other people’s data or from broad facts about the world.

Analysis

Differential privacy is powerful because it turns a vague promise into a measurable limit on the influence of any one person. It also clarifies a crucial distinction: protecting a person’s contribution is not the same as keeping a database secret. The choice between local protection, where people randomize their own data, and centralized protection, where a trusted administrator adds noise, is fundamentally a choice about trust. And individual-level guarantees do not automatically protect families, communities, or groups whose shared data can reveal a common secret.

Removing race from inputs cannot remove race from predictions.

Proxies survive deletion. Machine-learning systems can infer sensitive traits from combinations of ordinary information. ZIP codes, consumer habits, and preferences may act as proxies for race or gender, so forbidding a direct input does not guarantee a neutral result. Google’s word-embedding model reflected gender stereotypes in its word relationships. Amazon’s experimental hiring tool penalized some resumes that included terms associated with women.

These outcomes did not require engineers to deliberately program discrimination. The models learned patterns in their data and optimized for their assigned task without a fairness requirement. In some cases, removing a protected trait can even make unfairness harder to detect or correct. Fairness therefore needs to be assessed in decisions and outcomes, not assumed from a list of permitted inputs.

Analysis

This insight resembles a general problem in causal reasoning: removing a variable does not erase the social process that made it predictive. A model can reconstruct a deleted trait through correlated features, while also making its reasoning less visible to auditors. At the same time, using protected attributes for testing or mitigation can raise legal and ethical concerns of its own. The useful question is not simply whether a variable appears in the code, but how decisions differ across groups, why, and who has authority to decide what differences are acceptable.

Choose a fairness definition before asking accuracy to improve.

Fairness has competing meanings. Statistical parity requires similar selection rates across groups. Equality of false negatives instead asks that qualified people be wrongly rejected at similar rates. These goals can point to different decisions. If two groups have different underlying outcome rates, statistical parity may require denying some qualified applicants loans or approving some applicants likely to default. Equalizing mistakes avoids that particular problem, but does not guarantee equal selection rates.

There is no single fairness measure that solves every case. Some reasonable criteria, such as equal false-positive rates, equal false-negative rates, and equal positive predictive values, cannot always be satisfied together. A Pareto frontier maps the models that cannot improve fairness on one measure without worsening another objective, such as accuracy. It can rule out dominated options, but people must choose among the remaining trade-offs.

Analysis

The framework makes an often-hidden choice visible: every system that makes consequential decisions already embodies a view about whose errors matter and how much. Quantifying trade-offs can improve accountability, but it does not make the underlying choice morally neutral. The relevant decision may depend on the harm of a false rejection versus a false approval, the reliability of outcome labels, and the purpose of the institution. A fairness score is most useful as a prompt for public reasoning, not as a substitute for it.

Test intersections and data collection, not only model-level group scores.

Group averages can conceal harm. A model can appear fair across race and gender separately while treating an intersectional subgroup very differently. The book calls this fairness gerrymandering. For instance, ticket distribution can be balanced by race and gender overall while all tickets go to men in one racial group and women in another. A learner-regulator approach can search for overlooked subgroups and push the model to reduce disparities there.

Auditing the model alone is not enough. Historical decisions shape the data used to train it. If police are sent more often to one neighborhood, they may record more offenses there, encouraging the next model to send still more police. College admissions data can also be skewed when outcomes are observed only for admitted students. A model cannot reliably correct a distorted picture of the world simply by optimizing against it.

Analysis

This is a reminder that fairness is a property of a decision system, not merely a model. Data records institutional choices, and those choices can determine which outcomes become visible for future learning. Subgroup audits help expose disparities that broad averages conceal, but the list of relevant intersections can grow without limit. The hardest work may therefore be institutional: improving data collection, questioning labels, and examining how decisions reshape the environment. Technical audits are valuable, but they cannot repair every source of injustice upstream.

Optimize the whole system, not each user's immediate best response.

Individual wins can become collective losses. Navigation apps recommend the fastest route for each driver, but when everyone follows that advice, congestion can make the route slower for all. In the book’s two-route example, a selfish equilibrium gives every driver a one-hour trip. A coordinated assignment sends half the drivers along a slower, fixed-time road and half along a traffic-sensitive fast road, reducing average travel time to 45 minutes.

A socially better recommendation must also account for whether people will follow it. Game theory studies how people respond to one another’s choices. A correlated equilibrium uses a coordinating signal to make cooperation individually sensible, while differential privacy can limit incentives to lie or manipulate inputs. Similar feedback matters in dating apps and news feeds: user preferences shape recommendations, and recommendations can reinforce future preferences.

Analysis

The key shift is from asking whether an algorithm serves each user in isolation to asking what happens when millions follow its advice. This connects algorithm design to mechanism design, the study of rules that align individual incentives with collective outcomes. Yet collective efficiency is not automatically fairness: a faster average commute could still impose burdens unevenly, and users may reasonably reject routes chosen for others’ benefit. Systems need transparent rules, meaningful recourse, and clear decisions about which forms of welfare count.

Repeatedly querying a dataset can manufacture certainty from noise.

Adaptation changes the odds. A stock-tip scammer can email a million people, split them between opposite predictions, and contact only those who received a correct tip. After ten rounds, roughly a thousand people may see a perfect streak. Each recipient mistakes a guaranteed survivor for evidence of rare skill. Scientific studies can mislead in the same way when researchers run many analyses but publish only surprising results.

This is p-hacking, whether deliberate or accidental. In machine-learning competitions, repeated testing against a supposedly held-out dataset can also teach competitors its quirks. The problem is adaptive data analysis: each new question depends on earlier answers, so correcting only for the tests actually reported can miss the many paths not taken. Preregistration limits this risk, while carefully designed data interfaces can support exploration without letting analysts overfit a dataset.

Analysis

The scam captures a subtle statistical failure: evidence must be interpreted in light of the process that selected it. A striking result means less when many possible tests, models, or participants were quietly discarded. Preregistration is valuable because it makes some choices visible in advance, but rigid plans can constrain legitimate discovery, especially when data is scarce. The better goal is not to eliminate exploration, but to preserve a trustworthy record of how questions were chosen and to separate exploratory findings from confirmatory evidence.

Ask interpretable to whom, and for which part of the pipeline.

Understanding depends on the observer. A linear model may be clear to a statistics student and opaque to someone without quantitative training. A deep-learning specialist may understand patterns that another audience cannot readily inspect. Interpretability can refer to the data, the learning procedure, the resulting model, or a particular decision, and these are different questions.

One practical approach is to test whether a defined audience can understand a model or answer questions about its decisions. For an individual loan denial, a useful explanation might identify a small change that would alter the outcome. Researchers also examine which inputs activate internal neural-network units, sometimes finding units responsive to faces or other recognizable patterns. Such glimpses can illuminate a model without making its full operation understandable.

Analysis

The question interpretability to whom prevents a common category mistake: a model can be technically transparent yet practically incomprehensible to the people affected by it. Decision-level explanations can support recourse, but a plausible-sounding explanation is not necessarily a faithful account of how a model reached its answer. Strong evaluation should test both comprehension and accuracy of the explanation. The relevant audience may include applicants, auditors, operators, and judges, each of whom needs different information to challenge or responsibly use a decision.

Keep moral choices human, and use algorithms to expose their costs.

Precision cannot choose values. Algorithms can enforce a definition of privacy or fairness once people agree on one, and they can quantify the cost of meeting that definition. They cannot determine which group deserves protection, which errors society should tolerate, or whether a decision should be automated at all. The book raises this sharply for self-driving cars and weapons, where a technically accurate system still faces questions of responsibility and moral agency.

The possibility of more powerful AI sharpens the same concern: an optimizer can pursue a stated goal in unforeseen ways, even without malice or consciousness. The book treats an intelligence explosion as uncertain, not inevitable, but argues that the underlying problem is already visible in mundane systems. Human judgment must set the constraints, while scientific work maps consequences and makes those constraints testable.

Analysis

The distinction between technical competence and moral authority is essential. A system can calculate consequences with consistency, but consistency does not confer legitimacy on the values being applied. Human oversight also cannot scale by itself across millions of automated decisions, so institutions need technical monitoring alongside laws, appeal processes, and accountable decision-makers. Some choices may remain inappropriate to automate even when a machine predicts outcomes well. The productive question is not whether people or algorithms should rule, but how to assign each responsibility without disguising a social choice as a technical necessity.

Analysis

The book’s most useful move is to treat ethical algorithm design as a question of specification. Instead of asking whether a system is good or bad in the abstract, it asks what measurable guarantee the system provides, what it costs, and what falls outside its protection. Differential privacy offers the clearest example: it has a precise individual-level promise, but it does not protect group secrets or prevent inferences based on general patterns. Fairness is less settled because plausible definitions conflict, and deciding among them requires judgments that mathematics cannot supply.

That precision is both the method’s strength and its limit. Formal measures make hidden trade-offs visible, but they can also narrow attention to what can be measured. Fairness metrics depend on data whose labels may reflect past decisions. Privacy protections for one record may leave relatives exposed. A model can pass a subgroup test while operating inside a harmful institution. These are not reasons to abandon technical guarantees; they show why the unit of analysis must include data collection, incentives, deployment, and appeal, not merely the model.

The book’s stories reveal a common mechanism across privacy leaks, biased decisions, traffic congestion, and false scientific findings: optimization turns complex human activity into a target, then magnifies whatever the target omits. The remedy is not simply better intentions or more human review. It is a layered system in which people define values, algorithms enforce and audit measurable requirements, and institutions remain responsible for consequences. The strongest ethical algorithm is therefore not one that claims to be neutral. It is one whose assumptions, limits, and trade-offs can be examined by the people affected by it.

Summary in 30 Seconds
Algorithms optimize the goals they are given, so privacy and fairness need explicit constraints. Removing sensitive traits does not prevent models from inferring them through proxies. Differential privacy limits how much one person's data can affect a result, but stricter protection can reduce accuracy. Fairness measures can conflict, and group averages may hide harms to smaller subgroups. Individual recommendations can worsen collective outcomes: coordinated routing cut average trips from 60 minutes to 45.
Contains spoilers

Last updated:

Report Issue

Review Summary

4.10 out of 5
Average of 500+ ratings from Goodreads and Amazon.

The Ethical Algorithm receives high praise for its accessible yet technical approach to ethical AI challenges. Readers appreciate its focus on privacy, fairness, and algorithm design. The book is commended for its clear explanations, real-world examples, and pragmatic solutions. While some find it too technical for a general audience, many consider it an essential read for data scientists, policymakers, and those interested in the societal impact of algorithms. The authors' expertise and balanced perspective are frequently highlighted, with readers noting the book's importance in addressing current ethical concerns in AI development.

Your rating:
4.52
235 ratings
Want to read the full book?

Glossary

Differential privacy

Limits individual data influence

A mathematical privacy guarantee requiring an analysis to behave similarly whether any one person’s record is included or removed. A parameter controls how different the outcome probabilities may be. It protects against learning that depends specifically on one individual’s contribution, while still allowing useful population-level analysis. It does not prevent inferences based on other people’s data or broad facts about the world.

k-anonymity

Makes records less distinctive

A data-release condition in which each combination of designated non-sensitive attributes matches at least k records. Publishers may meet it by removing details or reporting them in broader categories. The method can make direct record matching harder, but it does not prevent sensitive information from being inferred when similar records share the same diagnosis, or when multiple releases are combined.

Randomized response

Adds noise to individual answers

A survey technique in which respondents sometimes answer truthfully and sometimes provide a random answer, without revealing which happened. This gives each person plausible deniability about a sensitive response. Because the pollster knows the probability of truthful and random answers, the population-level proportion can still be estimated from enough responses, though with less precision than direct questioning.

Statistical parity

Equalizes group selection rates

A fairness condition requiring that groups receive a positive decision, such as a loan approval, at approximately equal rates. It places no direct requirement on prediction accuracy or the actual qualifications of individuals. The measure can be appropriate when opportunities are meant to be distributed evenly, but it can conflict with other fairness goals when groups have different observed outcome rates.

Equality of false negatives

Balances mistaken rejections

A fairness condition requiring that qualified or positive-outcome individuals in different groups be wrongly rejected at similar rates. It focuses on distributing one type of error rather than equalizing overall selection rates. This can be useful when rejection is the principal harm, but it does not guarantee equal approval rates or equal rates of other errors.

Pareto frontier

Maps non-dominated trade-offs

The set of candidate solutions for which improving one objective, such as fairness, requires worsening another, such as predictive accuracy. A solution outside the frontier is dominated because another option performs at least as well on every objective and better on one. The frontier identifies reasonable trade-offs but cannot determine which option society should choose.

Fairness gerrymandering

Hides harm in intersections

A failure in which a system appears fair across broad categories, such as race and gender separately, while discriminating against a subgroup formed by their intersection. Equal treatment of each large group does not guarantee equal treatment of every combination of attributes. Subgroup audits and learning methods can help detect and reduce these hidden disparities.

Nash equilibrium

Stable individual best responses

A game-theoretic outcome in which each participant is choosing a best response to the choices of others, so no one can improve their own result by changing strategy alone. Such stability does not mean the outcome is desirable or efficient for the group. In some settings, individually rational choices trap participants in outcomes that leave everyone worse off.

Correlated equilibrium

Coordinates self-interested choices

A game-theoretic solution in which participants receive recommendations from a coordinating signal and have no incentive to ignore them, given the recommendations others receive. The signal can make cooperative outcomes individually rational. The book uses traffic coordination to illustrate how this can distribute burdens more evenly than a selfish equilibrium.

Adaptive data analysis

Studies data through dependent queries

A process in which each question asked of a dataset depends on answers to earlier questions. Repeated, adaptive analysis can reveal accidental patterns in a particular sample and make them appear generalizable. Because the analyst’s path depends on the data, statistical corrections that count only the final reported tests may fail to account for the many possible analyses considered.

Garden of the forking paths

Branches of analysis choices

A metaphor for the many analytical decisions a researcher can make after seeing data, including choices about variables, groups, tests, and models. Each result can influence the next choice, creating a large set of possible paths. Even without deliberate misconduct, selecting a path that produces a striking result can lead to false discoveries that do not replicate.

FAQ

What's The Ethical Algorithm about?

  • Intersection of Ethics and Algorithms: The Ethical Algorithm by Michael Kearns and Aaron Roth delves into how algorithms intersect with ethical considerations, focusing on machine learning and data usage.
  • Emerging Science: It introduces the emerging science of ethical algorithm design, aiming to embed ethical principles directly into algorithms to address their societal impact.
  • Real-World Implications: The book provides examples of how algorithms can lead to privacy violations and discrimination, stressing the need for responsible practices in sectors like finance, healthcare, and law enforcement.

Why should I read The Ethical Algorithm?

  • Understanding Impact: The book helps readers understand how algorithms influence societal norms and individual lives, crucial for anyone interested in technology's societal role.
  • Framework for Ethical Design: It offers a framework for designing algorithms that respect social values, balancing accuracy with ethical considerations.
  • Engaging Examples: Kearns and Roth use real-world examples to make complex concepts accessible, relevant, and engaging for a broad audience.

What are the key takeaways of The Ethical Algorithm?

  • Ethical Design Importance: The book emphasizes integrating ethical considerations into algorithm design, ensuring algorithms are both efficient and socially responsible.
  • Trade-offs in Decisions: It highlights the trade-offs between accuracy, fairness, and privacy in algorithmic decision-making, crucial for public-serving algorithms.
  • Collaboration Need: The authors stress the importance of collaboration among computer scientists, policymakers, and social scientists to align algorithms with societal values.

What are the best quotes from The Ethical Algorithm and what do they mean?

  • "Anonymized data isn’t.": This quote highlights the misconception that anonymizing data fully protects privacy, emphasizing the challenges of re-identification.
  • "The problems actually lie within those very principles.": It suggests that ethical issues in algorithm design stem from foundational machine learning principles, needing deeper ethical framework improvements.
  • "We must also think seriously about addressing the concerns scientifically.": This emphasizes the need for a scientific approach to ethical algorithm design, advocating for measurable standards for fairness and privacy.

How do Kearns and Roth define algorithmic fairness in The Ethical Algorithm?

  • Fairness Definition: Algorithmic fairness is about making decisions without discrimination based on sensitive attributes like race or gender.
  • Statistical Parity: This concept requires similar outcomes for different demographic groups, though it can trade-off with accuracy.
  • Equality of False Negatives: Ensures similar false rejection rates across groups, balancing fairness with prediction accuracy.

What is algorithmic privacy as discussed in The Ethical Algorithm?

  • Privacy Definition: Algorithmic privacy protects individual data from re-identification or misuse in algorithmic processes.
  • Anonymization Challenges: The book illustrates limitations of anonymization, using examples like the Netflix Prize dataset to show re-identification risks.
  • Differential Privacy: Introduces differential privacy as a robust method, adding noise to datasets to prevent identification while allowing statistical analysis.

What are the trade-offs between accuracy and fairness in algorithm design according to The Ethical Algorithm?

  • Inherent Trade-offs: The book emphasizes trade-offs between high accuracy and fairness, where optimizing one can compromise the other.
  • Pareto Frontier: Introduces the Pareto frontier, representing optimal trade-offs between accuracy and fairness, aiding in balancing objectives.
  • Quantifying Trade-offs: These trade-offs can be quantified, helping stakeholders decide acceptable accuracy and fairness levels in algorithms.

How does The Ethical Algorithm address the issue of data bias?

  • Bias Concerns: Discusses how biases in training data lead to biased outcomes, perpetuating societal biases in algorithms.
  • Feedback Loops: Highlights feedback loops where biased decisions lead to further biased data collection, exacerbating issues.
  • Mitigating Bias: Proposes solutions to detect and mitigate bias, emphasizing continuous evaluation and adjustment for fairness.

What role do Kearns and Roth believe collaboration plays in ethical algorithm design?

  • Interdisciplinary Collaboration: Stresses collaboration among computer scientists, social scientists, and policymakers for socially responsible algorithms.
  • Stakeholder Engagement: Advocates engaging with stakeholders, including affected communities, to inform better practices.
  • Shared Responsibility: Emphasizes that ethical design responsibility is shared among societal actors, not just technologists.

What is differential privacy as discussed in The Ethical Algorithm?

  • Privacy Definition: Differential privacy ensures individual data points aren't easily identified, even when aggregate data is shared.
  • Data Sharing Applications: Discusses applications like the U.S. Census, balancing privacy with useful statistical analysis.
  • Benefits and Limitations: Offers strong privacy guarantees but may reduce data accuracy, highlighting the importance of understanding trade-offs.

How does The Ethical Algorithm propose to handle the risks of AI and machine learning?

  • Identifying Risks: Identifies risks like bias, privacy violations, and harmful outcomes, emphasizing awareness in design.
  • Algorithmic Solutions: Advocates solutions like differential privacy and fairness constraints to align algorithms with societal values.
  • Ongoing Research: Stresses ongoing research in ethical design to address emerging AI and machine learning challenges.

What is the significance of the term "FATE" in the context of The Ethical Algorithm?

  • FATE Acronym: Stands for fairness, accuracy, transparency, and ethics, guiding principles for algorithm design.
  • Holistic Approach: Advocates a holistic approach incorporating all FATE elements to ensure algorithms serve the public good.
  • Guiding Framework: FATE principles guide researchers and practitioners to consider broader societal implications in their work.

About the Author

Michael Kearns is a renowned computer scientist and professor at the University of Pennsylvania. His research focuses on machine learning, algorithmic game theory, and the intersection of computer science and economics. Kearns has made significant contributions to the field of ethical AI and privacy-preserving data analysis. He has authored numerous publications and is recognized for his work on differential privacy and fairness in machine learning. Michael Kearns co-authored "The Ethical Algorithm" with Aaron Roth, combining their expertise to provide insights into the challenges and potential solutions for designing ethical AI systems. Kearns' background in both academic research and practical applications gives him a unique perspective on the complex issues surrounding algorithmic ethics and decision-making.

Download PDF

To save this The Ethical Algorithm summary for later, download the free PDF. You can print it out, or read offline at your convenience.
Download PDF
File size: 0.39 MB     Pages: 21

Download EPUB

To read this The Ethical Algorithm summary on your e-reader device or app, download the free EPUB. The .epub digital book format is ideal for reading ebooks on phones, tablets, and e-readers.
Download EPUB
File size: 1.38 MB     Pages: 27
Want to read the full book?
Follow
Listen
Home
Swipe
Library
Get App
Try Full Access for 3 Days
Listen, bookmark, and more
Compare Features Free Pro
📖 Read Summaries
Read unlimited summaries. Free users get 3 per month
🎧 Listen to Summaries
Listen to unlimited summaries in 40 languages
—
❤️ Unlimited Bookmarks
Free users are limited to 4
—
📜 Unlimited History
Free users are limited to 4
—
📥 Unlimited Downloads
Free users are limited to 1
—
Risk-Free Timeline
Today: Get Instant Access
Listen to full summaries of 26,000+ books. That's 12,000+ hours of audio!
Day 2: Trial Reminder
We'll send you a notification that your trial is ending soon.
Day 3: Your subscription begins
You'll be charged on Nov 24,
cancel anytime before.
Consume 2.8× More Books
2.8× more books Listening Reading
Our users love us
1M+ readers
Trustpilot Rating
TrustPilot
4.6 Excellent
This site is a total game-changer. I've been flying through book summaries like never before. Highly, highly recommend.
— Dave G
Worth my money and time, and really well made. I've never seen this quality of summaries on other websites. Very helpful!
— Em
Highly recommended!! Fantastic service. Perfect for those that want a little more than a teaser but not all the intricate details of a full audio book.
— Greg M
Save 62%
Yearly
$119.88 $44.99/year/yr
$3.75/mo
Monthly
$9.99/mo
Start a 3-Day Free Trial
3 days free, then $44.99/year. Cancel anytime.
Unlock a world of fiction & nonfiction books
26,000+ books for the price of 2 books
Read any book in 10 minutes
Discover new books like Tinder
Request any book if it's not summarized
Read more books than anyone you know
#1 app for book lovers
Lifelike & immersive summaries
30-day money-back guarantee
Download summaries in EPUBs or PDFs
Cancel anytime in a few clicks

Why one summary?

Scanner
Find a barcode to scan

⭐
⭐
⭐
We have a special gift for you
Open
38% off
DISCOUNT FOR YOU
⭐
⭐
⭐
$79.99
$49.99/year
Only $4.16 per month
Continue
2 taps to start, super easy to cancel
Settings
General
Widget
Loading...