Block #863,709

1CCLength 11★★★☆☆

Cunningham Chain of the First Kind · Discovered 12/22/2014, 4:51:40 PM · Difficulty 10.9627 · 5,953,981 confirmations

1CC
Cunningham Chain of the First Kind

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

Block Header
Block Hash
ba0e20c08906f5efd104a4a6ee85b783bad1fa375c6282c892588762d6be1b86

Height

#863,709

Difficulty

10.962725

Transactions

6

Size

1.30 KB

Version

2

Bits

0af6751d

Nonce

152,245,438

Timestamp

12/22/2014, 4:51:40 PM

Confirmations

5,953,981

Merkle Root

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

2.182 × 10⁹⁴(95-digit number)
21826309048719245282…00502212524452956159
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
2.182 × 10⁹⁴(95-digit number)
21826309048719245282…00502212524452956159
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
2
2^1 × origin − 1
4.365 × 10⁹⁴(95-digit number)
43652618097438490564…01004425048905912319
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
3
2^2 × origin − 1
8.730 × 10⁹⁴(95-digit number)
87305236194876981129…02008850097811824639
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
4
2^3 × origin − 1
1.746 × 10⁹⁵(96-digit number)
17461047238975396225…04017700195623649279
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
5
2^4 × origin − 1
3.492 × 10⁹⁵(96-digit number)
34922094477950792451…08035400391247298559
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
6
2^5 × origin − 1
6.984 × 10⁹⁵(96-digit number)
69844188955901584903…16070800782494597119
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
7
2^6 × origin − 1
1.396 × 10⁹⁶(97-digit number)
13968837791180316980…32141601564989194239
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
8
2^7 × origin − 1
2.793 × 10⁹⁶(97-digit number)
27937675582360633961…64283203129978388479
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
9
2^8 × origin − 1
5.587 × 10⁹⁶(97-digit number)
55875351164721267922…28566406259956776959
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
10
2^9 × origin − 1
1.117 × 10⁹⁷(98-digit number)
11175070232944253584…57132812519913553919
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
11
2^10 × origin − 1
2.235 × 10⁹⁷(98-digit number)
22350140465888507169…14265625039827107839
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,785,579 XPM·at block #6,817,689 · 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