Block #843,462

1CCLength 11★★★☆☆

Cunningham Chain of the First Kind · Discovered 12/7/2014, 10:02:04 AM · Difficulty 10.9732 · 5,998,867 confirmations

1CC
Cunningham Chain of the First Kind

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

Block Header
Block Hash
ff94d9fdc91e81d81180a2a3a1b09c941152ead860e259511e6f578c1f89f6b3

Height

#843,462

Difficulty

10.973195

Transactions

17

Size

3.68 KB

Version

2

Bits

0af92356

Nonce

1,546,471,551

Timestamp

12/7/2014, 10:02:04 AM

Confirmations

5,998,867

Merkle Root

f40cda491140f26119d62b3968537b671ba35df26271c0ea644a951e2f8115e2
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.

3.695 × 10⁹⁶(97-digit number)
36959501742352260264…65980466777191920639
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
3.695 × 10⁹⁶(97-digit number)
36959501742352260264…65980466777191920639
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
2
2^1 × origin − 1
7.391 × 10⁹⁶(97-digit number)
73919003484704520528…31960933554383841279
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
3
2^2 × origin − 1
1.478 × 10⁹⁷(98-digit number)
14783800696940904105…63921867108767682559
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
4
2^3 × origin − 1
2.956 × 10⁹⁷(98-digit number)
29567601393881808211…27843734217535365119
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
5
2^4 × origin − 1
5.913 × 10⁹⁷(98-digit number)
59135202787763616423…55687468435070730239
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
6
2^5 × origin − 1
1.182 × 10⁹⁸(99-digit number)
11827040557552723284…11374936870141460479
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
7
2^6 × origin − 1
2.365 × 10⁹⁸(99-digit number)
23654081115105446569…22749873740282920959
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
8
2^7 × origin − 1
4.730 × 10⁹⁸(99-digit number)
47308162230210893138…45499747480565841919
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
9
2^8 × origin − 1
9.461 × 10⁹⁸(99-digit number)
94616324460421786277…90999494961131683839
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
10
2^9 × origin − 1
1.892 × 10⁹⁹(100-digit number)
18923264892084357255…81998989922263367679
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
11
2^10 × origin − 1
3.784 × 10⁹⁹(100-digit number)
37846529784168714510…63997979844526735359
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,983,040 XPM·at block #6,842,328 · 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