Block #553,927

2CCLength 11★★★☆☆

Cunningham Chain of the Second Kind · Discovered 5/20/2014, 11:49:08 AM · Difficulty 10.9631 · 6,252,735 confirmations

2CC
Cunningham Chain of the Second Kind

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

Block Header
Block Hash
536106c90e33dfbd8bef2b35b8b9d3d87910c035823b3462354b5b313b882a0a

Height

#553,927

Difficulty

10.963070

Transactions

5

Size

1.52 KB

Version

2

Bits

0af68bc3

Nonce

769,380,369

Timestamp

5/20/2014, 11:49:08 AM

Confirmations

6,252,735

Merkle Root

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

5.699 × 10⁹⁷(98-digit number)
56994693105462908505…49276292771414136401
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
5.699 × 10⁹⁷(98-digit number)
56994693105462908505…49276292771414136401
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
2
2^1 × origin + 1
1.139 × 10⁹⁸(99-digit number)
11398938621092581701…98552585542828272801
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
3
2^2 × origin + 1
2.279 × 10⁹⁸(99-digit number)
22797877242185163402…97105171085656545601
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
4
2^3 × origin + 1
4.559 × 10⁹⁸(99-digit number)
45595754484370326804…94210342171313091201
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
5
2^4 × origin + 1
9.119 × 10⁹⁸(99-digit number)
91191508968740653608…88420684342626182401
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
6
2^5 × origin + 1
1.823 × 10⁹⁹(100-digit number)
18238301793748130721…76841368685252364801
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
7
2^6 × origin + 1
3.647 × 10⁹⁹(100-digit number)
36476603587496261443…53682737370504729601
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
8
2^7 × origin + 1
7.295 × 10⁹⁹(100-digit number)
72953207174992522886…07365474741009459201
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
9
2^8 × origin + 1
1.459 × 10¹⁰⁰(101-digit number)
14590641434998504577…14730949482018918401
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
10
2^9 × origin + 1
2.918 × 10¹⁰⁰(101-digit number)
29181282869997009154…29461898964037836801
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
11
2^10 × origin + 1
5.836 × 10¹⁰⁰(101-digit number)
58362565739994018309…58923797928075673601
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,697,393 XPM·at block #6,806,661 · 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