Block #667,540

2CCLength 11★★★☆☆

Cunningham Chain of the Second Kind · Discovered 8/7/2014, 5:02:44 PM · Difficulty 10.9627 · 6,157,995 confirmations

2CC
Cunningham Chain of the Second Kind

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

Block Header
Block Hash
3b85b89b2cf325290745e4c1340c964d4fec3c39628b1e7fe3d276f8bbb7282b

Height

#667,540

Difficulty

10.962745

Transactions

7

Size

1.67 KB

Version

2

Bits

0af6766f

Nonce

827,503,828

Timestamp

8/7/2014, 5:02:44 PM

Confirmations

6,157,995

Merkle Root

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

7.796 × 10⁹⁴(95-digit number)
77962735941693839622…96074080624344138081
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
7.796 × 10⁹⁴(95-digit number)
77962735941693839622…96074080624344138081
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
2
2^1 × origin + 1
1.559 × 10⁹⁵(96-digit number)
15592547188338767924…92148161248688276161
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
3
2^2 × origin + 1
3.118 × 10⁹⁵(96-digit number)
31185094376677535849…84296322497376552321
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
4
2^3 × origin + 1
6.237 × 10⁹⁵(96-digit number)
62370188753355071698…68592644994753104641
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
5
2^4 × origin + 1
1.247 × 10⁹⁶(97-digit number)
12474037750671014339…37185289989506209281
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
6
2^5 × origin + 1
2.494 × 10⁹⁶(97-digit number)
24948075501342028679…74370579979012418561
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
7
2^6 × origin + 1
4.989 × 10⁹⁶(97-digit number)
49896151002684057358…48741159958024837121
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
8
2^7 × origin + 1
9.979 × 10⁹⁶(97-digit number)
99792302005368114717…97482319916049674241
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
9
2^8 × origin + 1
1.995 × 10⁹⁷(98-digit number)
19958460401073622943…94964639832099348481
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
10
2^9 × origin + 1
3.991 × 10⁹⁷(98-digit number)
39916920802147245886…89929279664198696961
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
11
2^10 × origin + 1
7.983 × 10⁹⁷(98-digit number)
79833841604294491773…79858559328397393921
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 Second 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 2CC formula:

2CC: p₁ (first prime), p₂ = 2p₁ − 1, p₃ = 2p₂ − 1, …
Circulating Supply:57,848,378 XPM·at block #6,825,534 · 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