Block #577,660

2CCLength 10★★☆☆☆

Cunningham Chain of the Second Kind · Discovered 6/5/2014, 11:17:03 AM · Difficulty 10.9687 · 6,249,417 confirmations

2CC
Cunningham Chain of the Second Kind

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

Block Header
Block Hash
530af62d4eddbe8a515c09bfe9b482d41c9bbb69afffba52a4ab010aeb214513

Height

#577,660

Difficulty

10.968698

Transactions

1

Size

732 B

Version

2

Bits

0af7fc90

Nonce

71,631

Timestamp

6/5/2014, 11:17:03 AM

Confirmations

6,249,417

Merkle Root

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

1.850 × 10⁹⁶(97-digit number)
18508094598688405643…04710926909698828001
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
1.850 × 10⁹⁶(97-digit number)
18508094598688405643…04710926909698828001
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
2
2^1 × origin + 1
3.701 × 10⁹⁶(97-digit number)
37016189197376811286…09421853819397656001
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
3
2^2 × origin + 1
7.403 × 10⁹⁶(97-digit number)
74032378394753622572…18843707638795312001
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
4
2^3 × origin + 1
1.480 × 10⁹⁷(98-digit number)
14806475678950724514…37687415277590624001
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
5
2^4 × origin + 1
2.961 × 10⁹⁷(98-digit number)
29612951357901449028…75374830555181248001
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
6
2^5 × origin + 1
5.922 × 10⁹⁷(98-digit number)
59225902715802898057…50749661110362496001
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
7
2^6 × origin + 1
1.184 × 10⁹⁸(99-digit number)
11845180543160579611…01499322220724992001
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
8
2^7 × origin + 1
2.369 × 10⁹⁸(99-digit number)
23690361086321159223…02998644441449984001
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
9
2^8 × origin + 1
4.738 × 10⁹⁸(99-digit number)
47380722172642318446…05997288882899968001
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
10
2^9 × origin + 1
9.476 × 10⁹⁸(99-digit number)
94761444345284636892…11994577765799936001
Verify on FactorDB ↗Wolfram Alpha ↗

What this block proved

The miner who found this block proved the existence of 10 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
UncommonChain length 10

Roughly 1 in 100 blocks. Solid but expected in a healthy network.

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,860,800 XPM·at block #6,827,076 · 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