Block #563,679

1CCLength 11★★★☆☆

Cunningham Chain of the First Kind · Discovered 5/27/2014, 2:58:57 AM · Difficulty 10.9648 · 6,249,367 confirmations

1CC
Cunningham Chain of the First Kind

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

Block Header
Block Hash
fa2168b230c7a889dc51fa43befc55ae0831ee8141838c0d6b21a2c3ea6dcb7f

Height

#563,679

Difficulty

10.964828

Transactions

5

Size

1.52 KB

Version

2

Bits

0af6fef5

Nonce

31,666

Timestamp

5/27/2014, 2:58:57 AM

Confirmations

6,249,367

Merkle Root

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

4.998 × 10⁹⁹(100-digit number)
49984080484890978267…28316661002680898879
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
4.998 × 10⁹⁹(100-digit number)
49984080484890978267…28316661002680898879
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
2
2^1 × origin − 1
9.996 × 10⁹⁹(100-digit number)
99968160969781956534…56633322005361797759
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
3
2^2 × origin − 1
1.999 × 10¹⁰⁰(101-digit number)
19993632193956391306…13266644010723595519
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
4
2^3 × origin − 1
3.998 × 10¹⁰⁰(101-digit number)
39987264387912782613…26533288021447191039
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
5
2^4 × origin − 1
7.997 × 10¹⁰⁰(101-digit number)
79974528775825565227…53066576042894382079
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
6
2^5 × origin − 1
1.599 × 10¹⁰¹(102-digit number)
15994905755165113045…06133152085788764159
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
7
2^6 × origin − 1
3.198 × 10¹⁰¹(102-digit number)
31989811510330226090…12266304171577528319
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
8
2^7 × origin − 1
6.397 × 10¹⁰¹(102-digit number)
63979623020660452181…24532608343155056639
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
9
2^8 × origin − 1
1.279 × 10¹⁰²(103-digit number)
12795924604132090436…49065216686310113279
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
10
2^9 × origin − 1
2.559 × 10¹⁰²(103-digit number)
25591849208264180872…98130433372620226559
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
11
2^10 × origin − 1
5.118 × 10¹⁰²(103-digit number)
51183698416528361745…96260866745240453119
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,748,412 XPM·at block #6,813,045 · 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.

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