Block #810,947

1CCLength 11★★★☆☆

Cunningham Chain of the First Kind · Discovered 11/14/2014, 4:23:14 PM · Difficulty 10.9732 · 6,015,912 confirmations

1CC
Cunningham Chain of the First Kind

A sequence where each prime is double the previous prime plus one.

Block Header
Block Hash
7eeb6307100eb0485efb0f5298c03915278e1a1ed5a75f1ddeb168116e9a90fc

Height

#810,947

Difficulty

10.973236

Transactions

4

Size

1.88 KB

Version

2

Bits

0af925fb

Nonce

441,649,318

Timestamp

11/14/2014, 4:23:14 PM

Confirmations

6,015,912

Merkle Root

01e40f2a1c8ad278db4ba54dc3277fe0bc4777a8cb187476a39ff2f2cc1406f3
Prime Chain Origin

This is the prime chain origin stored in the block header. It is a composite number (not prime itself) — it equals the first prime in the chain multiplied by a primorial. The origin anchors the entire chain to this specific block.

5.485 × 10⁹⁴(95-digit number)
54859132862027113727…42344809391787214609
Discovered Prime Numbers
p_k = 2^k × origin − 1

These are the actual prime numbers discovered by this block, computed using the verified Primecoin formula. Each number has been independently confirmed to pass the Fermat primality test. Use the FactorDB links to verify any number independently.

1
origin − 1
5.485 × 10⁹⁴(95-digit number)
54859132862027113727…42344809391787214609
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
2
2^1 × origin − 1
1.097 × 10⁹⁵(96-digit number)
10971826572405422745…84689618783574429219
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
3
2^2 × origin − 1
2.194 × 10⁹⁵(96-digit number)
21943653144810845490…69379237567148858439
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
4
2^3 × origin − 1
4.388 × 10⁹⁵(96-digit number)
43887306289621690981…38758475134297716879
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
5
2^4 × origin − 1
8.777 × 10⁹⁵(96-digit number)
87774612579243381963…77516950268595433759
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
6
2^5 × origin − 1
1.755 × 10⁹⁶(97-digit number)
17554922515848676392…55033900537190867519
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
7
2^6 × origin − 1
3.510 × 10⁹⁶(97-digit number)
35109845031697352785…10067801074381735039
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
8
2^7 × origin − 1
7.021 × 10⁹⁶(97-digit number)
70219690063394705570…20135602148763470079
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
9
2^8 × origin − 1
1.404 × 10⁹⁷(98-digit number)
14043938012678941114…40271204297526940159
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
10
2^9 × origin − 1
2.808 × 10⁹⁷(98-digit number)
28087876025357882228…80542408595053880319
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
11
2^10 × origin − 1
5.617 × 10⁹⁷(98-digit number)
56175752050715764456…61084817190107760639
Verify on FactorDB ↗Wolfram Alpha ↗

What this block proved

The miner who found this block proved the existence of 11 consecutive prime numbers forming a Cunningham Chain of the First Kind. The prime chain origin — the large number shown above — anchors the chain and is divisible by a primorial (the product of small primes), cryptographically tying these prime numbers to this specific block.

★★★☆☆
Rarity
RareChain length 11

Approximately 1 in 1,000 blocks. Noteworthy discoveries.

How Primecoin's Proof-of-Work Constructs These Primes

Primecoin stores a value called the prime chain origin in each block. The miner found a large integer such that when divided by a primorial (the product of small primes: 2 × 3 × 5 × 7 × …), the result is the first prime in the chain. The origin is deliberately divisible by this primorial — that divisibility is part of the proof.

Prime Chain Origin = First Prime × Primorial (2·3·5·7·11·…)
Source: Primecoin prime.cpp — CheckPrimeProofOfWork()

This is why the origin has many small prime factors — those factors are the primorial divisor. The chain then extends from the first prime using the 1CC formula:

1CC: p₁ (first prime), p₂ = 2p₁ + 1, p₃ = 2p₂ + 1, …
Circulating Supply:57,859,040 XPM·at block #6,826,858 · updates every 60s
xpmprime.info is a work in progress. If you enjoy using this service you can support this project with a Primecoin donation.
Privacy Policy·

Cookie Preferences

We use cookies to enhance your experience. Some are essential for the site to function, while others help us understand how you use the site.

·Privacy Policy