Block #533,578

2CCLength 10★★☆☆☆

Cunningham Chain of the Second Kind · Discovered 5/9/2014, 7:13:29 PM · Difficulty 10.9001 · 6,276,603 confirmations

2CC
Cunningham Chain of the Second Kind

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

Block Header
Block Hash
b14047d5e5ffe5f2557d039ce1cad82f756f4ffe2103aa1db923449fdc45008d

Height

#533,578

Difficulty

10.900070

Transactions

5

Size

1.52 KB

Version

2

Bits

0ae66af6

Nonce

40,271,809

Timestamp

5/9/2014, 7:13:29 PM

Confirmations

6,276,603

Merkle Root

ab79446bc6ef8c9df5757e2e3c681b6b6666c764c602a3a617292fb71a9ea402
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.273 × 10⁹⁷(98-digit number)
12737996054501480716…81040460081491649241
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.273 × 10⁹⁷(98-digit number)
12737996054501480716…81040460081491649241
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
2
2^1 × origin + 1
2.547 × 10⁹⁷(98-digit number)
25475992109002961433…62080920162983298481
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
3
2^2 × origin + 1
5.095 × 10⁹⁷(98-digit number)
50951984218005922867…24161840325966596961
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
4
2^3 × origin + 1
1.019 × 10⁹⁸(99-digit number)
10190396843601184573…48323680651933193921
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
5
2^4 × origin + 1
2.038 × 10⁹⁸(99-digit number)
20380793687202369147…96647361303866387841
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
6
2^5 × origin + 1
4.076 × 10⁹⁸(99-digit number)
40761587374404738294…93294722607732775681
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
7
2^6 × origin + 1
8.152 × 10⁹⁸(99-digit number)
81523174748809476588…86589445215465551361
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
8
2^7 × origin + 1
1.630 × 10⁹⁹(100-digit number)
16304634949761895317…73178890430931102721
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
9
2^8 × origin + 1
3.260 × 10⁹⁹(100-digit number)
32609269899523790635…46357780861862205441
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
10
2^9 × origin + 1
6.521 × 10⁹⁹(100-digit number)
65218539799047581270…92715561723724410881
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,725,517 XPM·at block #6,810,180 · 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