Block #668,570

2CCLength 11★★★☆☆

Cunningham Chain of the Second Kind · Discovered 8/8/2014, 8:16:37 AM · Difficulty 10.9636 · 6,148,253 confirmations

2CC
Cunningham Chain of the Second Kind

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

Block Header
Block Hash
aa96e8f36e30f2c7a3b269d933dea9023fbef5c10eb6cdbcdb04d0464e2ab828

Height

#668,570

Difficulty

10.963612

Transactions

12

Size

3.78 KB

Version

2

Bits

0af6af43

Nonce

429,222,154

Timestamp

8/8/2014, 8:16:37 AM

Confirmations

6,148,253

Merkle Root

a880445fa5a34b815903a1a6dbf00ebf8b69ff485f3b1d443c73a5b33f4c7961
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.357 × 10⁹⁷(98-digit number)
23578209515565639780…15867120274895751681
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.357 × 10⁹⁷(98-digit number)
23578209515565639780…15867120274895751681
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
2
2^1 × origin + 1
4.715 × 10⁹⁷(98-digit number)
47156419031131279561…31734240549791503361
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
3
2^2 × origin + 1
9.431 × 10⁹⁷(98-digit number)
94312838062262559123…63468481099583006721
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
4
2^3 × origin + 1
1.886 × 10⁹⁸(99-digit number)
18862567612452511824…26936962199166013441
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
5
2^4 × origin + 1
3.772 × 10⁹⁸(99-digit number)
37725135224905023649…53873924398332026881
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
6
2^5 × origin + 1
7.545 × 10⁹⁸(99-digit number)
75450270449810047299…07747848796664053761
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
7
2^6 × origin + 1
1.509 × 10⁹⁹(100-digit number)
15090054089962009459…15495697593328107521
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
8
2^7 × origin + 1
3.018 × 10⁹⁹(100-digit number)
30180108179924018919…30991395186656215041
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
9
2^8 × origin + 1
6.036 × 10⁹⁹(100-digit number)
60360216359848037839…61982790373312430081
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
10
2^9 × origin + 1
1.207 × 10¹⁰⁰(101-digit number)
12072043271969607567…23965580746624860161
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
11
2^10 × origin + 1
2.414 × 10¹⁰⁰(101-digit number)
24144086543939215135…47931161493249720321
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,778,623 XPM·at block #6,816,822 · 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