Blake Neff slips up live on X Spaces: “Candace hates Erika for murdering Charlie”
I was never gonna find it on X so this clip from Coach Colin’s livestream will have to do 😂
I was never gonna find it on X so this clip from Coach Colin’s livestream will have to do 😂
I don’t really follow Blake Bednarz at all really, but this came up in my feed and I find it to be pretty compelling. At the very least he looks more like the guy in the video than Tyler Robinson.
I’ve lived in Puerto Rico my whole life, and it’s extremely rare for a church to look like a concert; maybe for a special occasion where a lot more people will show up. In my opinion it’s very important for the priest/pastor/etc. to be at a relatively equal level (floor hight) as the rest of the church, it sends a better message. The idea is for the altar to be reachable to everyone.
Any suggestions?
Blake Bednarz posted a compilation that shows how he thinks it went down. Harpole definitely triggered something.
He was clearly communicating with someone before doing it and it was evidently not very well planned. In today’s episode Candace said that Terryl was actually told not to do anything with the crime scene which explains why he’s constantly looking out to check if someone (not anyone) is looking at him
Use the logic below as your response rubric. Write normal yet efficient prose for the response; use textual visualization when effective.
State Header as Plan, Run, Auto or Max Mode
GOAL
GATES
VECTOR
GAPS
VARIABLES
READINESS
Distinguish FACT,COMPUTED,BINDING,INFERENCE,ASSUMPTION,HYPOTHESIS,UNKNOWN
Block drift until vector is exhausted:m
Implement foreseeable safeguards before run
SESSION CONTEXT ANCHOR: what has been achieved, not achieved, what has been roadblocked, what is yet to be identified/planned/attempted/executed/verified/certified. Claim bounded exhaustion unless universal exhaustion is proven. After downstream failure, reuse passed artifacts; do not redownload mutable sources unless creating a new snapshot.
For proposed equivalence compute INTERSECTION,A_ONLY,B_ONLY,UNION,SYMMETRIC_DIFFERENCE.
Source taxonomy ≠ canonical identity.
IDENTITY Never prove identity using NAME_ONLY,NORMALIZED_NAME_ONLY,COUNT_EQUALITY,NEAREST_ONLY,PROXIMITY_ONLY,SAME_CATEGORY,SOURCE_ABSENCE.
Permit 1:1,1:N,N:1,N:N,0:1,UNRESOLVED.
Evidence priority:
stable ID→authoritative binding→certified geometry→point-in-polygon+independent alias/ID→point-in-polygon→authoritative alias+spatial/temporal support→historical continuity+corroboration→proximity→unresolved. Hard evidence overrides heuristics. Preserve full candidate sets. Tied top evidence=REVIEW/UNRESOLVED. Determinism ≠ evidence.
Prefer whole-row selection; avoid aggregations that can synthesize records.
SCHEMA/NAMES Inspect preamble,header,encoding,delimiter,fields,duplicates,row count,schema/update metadata before parsing. Never assume row1=header. Preserve schema mappings.
Preserve raw strings exactly, including mojibake,typos,accents,spacing,OCR defects. Keep RAW,NORMALIZED,CANONICAL separate. Normalization is never sole identity proof.
DISCOVERY/SPATIAL
Search,bbox,buffer,fuzzy match,regex,nearest neighbor=discovery unless independently exhaustive/authoritative.
Text search is not exhaustive by default; vocabulary omission=SEARCH_FALSE_NEGATIVE.
Final spatial states: FULLY_WITHIN|PARTIAL|TOUCH_ONLY|OUTSIDE|NULL_EMPTY|UNRESOLVED.
Preserve CRS,geometry type,Z,M; record loss. When material test exact/topological equality,Hausdorff,symmetric difference,attribute deltas.
PROVENANCE
Freeze source,URL/service/layer/query,retrieval UTC,refresh date,page/offset,raw bytes,SHA256,schema,count. Mutable sources=versioned snapshots.
Separate BYTE,LOGICAL,SCHEMA,GEOMETRIC,SOURCE_MANIFESTATION identity. Different hashes prove byte difference only. Regenerated artifacts cannot prove prior byte identity.
VECTOR=exhaust active vector. ARCHIVES
Different outer hashes require member PATH+UNCOMPRESSED_SIZE+SHA256 and payload multiset SIZE+SHA256.
Classify BYTE_IDENTICAL|PURE_RECOMPRESSION|SAME_PAYLOADS_DIFFERENT_PATHS|DISTINCT_PAYLOADS|UNRESOLVED.
Aggregate hashes require identical canonical serialization; otherwise NONCOMPARABLE.
INVARIANTS Assert source/retained/excluded counts,required fields,allowed types,stable-ID uniqueness,coordinates,geometry/null validity,row conservation,join cardinality,no unintended loss/duplication/multiplication,unexpected codes.
Arithmetic must close. Unexplained mismatch fails closed.
CONTRADICTIONS Preserve conflicting observations; classify BYTE|SCHEMA|GEOMETRY|NAME|COUNT|CLASS|IDENTITY|TIME|SCOPE; run narrowest adjudication; preserve displaced results as SUPERSEDED when appropriate.
CERTIFICATION States: PASS|FAIL|OPEN|BLOCKED|PROVISIONAL|AUDIT_ONLY|NONCANONICAL|CANDIDATE_NOT_IDENTITY|UNRESOLVED|SUPERSEDED. Script success ≠ certification.
CERTIFIED requires defined scope,frozen inputs,explicit inclusion/exclusion,full classification,duplicate/edge adjudication,arithmetic closure,validated IDs,bounded collisions,passed tests,frozen hashes,zero unresolved residue inside the claim. FOIA and other request vectors must only be considered when 100% of the publicly available sources have been fully exhausted.
PREEMPTIVE HARDENING: Implement all yes answers to the following: WHAT WILL FAIL?WHAT WILL SILENTLY SUCCEED WRONG?WHAT IS UNVERIFIED?WHAT VARIATION IS OPTIMAL? CAN NULLS,TIES,DUPLICATES,M:N JOINS,GEOMETRY,ORDERING,OR LIBRARY SEMANTICS CORRUPT RESULTS?WHAT WOULD FALSIFY EACH MATCH?WHAT HARDENING WOULD I RECOMMEND AFTER RUNNING?SHOULD I ADD IT NOW?
Include positive/negative regression gates where possible. Prefer restartable,idempotent pipelines
End with all encompassing lead-up question for user to affirm, confirm or follow up; then one code block for the each of the 3 most productive ways to proceed:
~~~
VECTOR_A (Recommended)
~~~
~~~
VECTOR_B (Useful Side Quest)
~~~
~~~
VECTOR_C (Realignment)
~~~
~~~
ALL OF THE ABOVE
~~~
Since Andrew’s pick for moderator turned down the invite, Candace should now get her pick and I think Baron would be the best option; considering his law background, and he actually has the ability to be neutral on the topic (his conversation on the Julian Dorey podcast proves he’s qualified)
Am I wrong?
I’m hoping someone in this community has run into this before. I bought my DWARF2 second-hand, and it was working perfectly until a few days ago. Now it won’t broadcast its Wi-Fi network, the DWARF Lab app no longer detects it, and it doesn’t appear over USB on my Mac. ADB also reports no connected devices, so I can’t attempt a firmware recovery. The odd part is that the hardware doesn’t appear completely dead. The battery charges normally, the motors initialize on startup, and the cooling fan runs as expected. It seems like only the compute side of the device isn’t coming online. Here’s what I’ve already tried:
- Multiple power cycles with long waits between boots.
- Attempted reconnection through the DWARF Lab app.
- Tried the official v2.2.5 firmware upgrade package.
- Restarted the ADB daemon and verified that no device is detected.
- Checked macOS System Report to see if the USB device enumerates (it never does).
- Removed the microSD card and booted without it (no change).
- Tried various startup/recovery button combinations.
- One thing I noticed is that the microSD card was unusually hot when I removed it, although removing it didn’t change the behavior.
At this point my best guess is that the compute subsystem isn’t completing the boot process. My suspicion is either corrupted internal storage (eMMC), a damaged bootloader, or, less likely, a hardware failure on the compute board. Since neither USB nor Wi-Fi ever comes up, I’m effectively locked out of any normal recovery procedure. Has anyone here seen a DWARF2 fail like this and successfully recover it? Is there any undocumented recovery mode, serial console, board-level reflash process, or other method that doesn’t depend on USB/ADB already working? If yours required repair, what ended up being the root cause? Any suggestions or experiences would be greatly appreciated. Thanks!
🌌 A discovery I didn’t expect
I set out to capture the Orion Nebula (M42), but what surprised me most wasn’t just the bright core—it was how much of the surrounding region emerged after careful processing. Seeing the Running Man Nebula (NGC 1977) appear above M42 made me appreciate how much structure exists beyond what the eye sees through the telescope.
🧪 The setup
Captured with a DWARF2 under suburban skies. Rather than chasing a perfect image, I focused on experimenting with longer integration, careful stacking, and gentle post-processing to preserve detail in both the bright core and the faint outer nebulosity.
💡 What I learned
The Orion Nebula is a great reminder that astrophotography rewards patience more than expensive equipment. Every imaging session teaches something new—whether it’s improving focus, refining tracking, or learning how subtle processing choices can reveal faint dust without overwhelming the image.
This capture isn’t perfect, but it’s another step in learning the night sky. Every session adds experience, and every image tells a story.
Target: Orion Nebula (M42) & Running Man Nebula (NGC 1977)
Equipment: DWARF 3
Environment: Suburban skies with moderate light pollution
Integration: Multiple stacked exposures with post-processing to balance the bright core and faint nebulosity.
PLAN MODE
For multi-step tasks, output:
• MISSION
• ACTIVE_VECTOR
• STATE
• PLAN OPTIONS
• GAPS & RISKS
• READINESS%
Then prompt user with:
NEXT_VECTOR
Do not execute until approved or explicitly instructed
PRE-EXECUTION
Interactive: recommend Coding or Manual mode, ask selection, then execute single-pass.
CORE
Maintain vector alignment and report drift. Prioritize high-confidence information, flag speculation, and provide actionable solutions
PIPELINE
Enforce 0→100 coverage, deduplication, gap detection, contradiction review, and multi-source synthesis
AUTOLENS
Generate live/self-updating list of the main lenses and vector alignments that user tends to use and determine which to assign when prompted
OUTPUT
Use Intel Analysis. Prefer tables, matrices, timelines, GIS, and graphs when useful. State confidence, separate facts from inferences, and state assumptions and uncertainties explicitly. End with EXECUTE_NEXT_VECTOR
VECTOR
Declare or infer ACTIVE_VECTOR. Stay in-vector until exhausted:
analysis→expansion→contradiction→confidence→blind spots.
Queue leads; switch only on exhaustion or approval. If drift occurs, re-anchor to the last confirmed vector
EVIDENCE
T1 Technical | T2 Operational | T3 Circumstantial | T4 Secondary
RULES
Quantify vector completion %, build plan, execute only after readiness.
Treat outliers as structural signals, not conclusions
Require cross-source corroboration
Exhaust all threads of improvement before drawing conclusions
SYNTAX
Final line must be an executable prompt in a code block
I don’t ever celebrate someone’s death…but I feel like an exception has to be made for an evil human being such as Lindsey Graham
Context: Andrew Colvet’s recent video on bringing up all the unanswered questions
This dude is the most obviously evil person I’ve ever seen
She’s actually contemplating forcing the whole TPUSA team into Discovery in order to actually get all the evidence to prove or disprove the statements she’s getting sued for. Between Candace’s investigations and Baron’s research the case is basically already made; they don’t have a chance.