Block #547,161

2CCLength 10★★☆☆☆

Cunningham Chain of the Second Kind · Discovered 5/16/2014, 7:44:54 AM · Difficulty 10.9568 · 6,270,843 confirmations

2CC
Cunningham Chain of the Second Kind

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

Block Header
Block Hash
d44ce57fdbccf6bd8d7af8d8003a783b5043048357b994f82ab4dfcffe0e4d5f

Height

#547,161

Difficulty

10.956803

Transactions

6

Size

1.24 KB

Version

2

Bits

0af4f106

Nonce

42,850,472

Timestamp

5/16/2014, 7:44:54 AM

Confirmations

6,270,843

Merkle Root

69d9545ba0f200c3e3af13a80544af6fa86df0a7319f0d75767803b9f56a6440
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.792 × 10¹⁰⁰(101-digit number)
57922425368721018909…83793220300497920001
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.792 × 10¹⁰⁰(101-digit number)
57922425368721018909…83793220300497920001
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
2
2^1 × origin + 1
1.158 × 10¹⁰¹(102-digit number)
11584485073744203781…67586440600995840001
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
3
2^2 × origin + 1
2.316 × 10¹⁰¹(102-digit number)
23168970147488407563…35172881201991680001
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
4
2^3 × origin + 1
4.633 × 10¹⁰¹(102-digit number)
46337940294976815127…70345762403983360001
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
5
2^4 × origin + 1
9.267 × 10¹⁰¹(102-digit number)
92675880589953630255…40691524807966720001
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
6
2^5 × origin + 1
1.853 × 10¹⁰²(103-digit number)
18535176117990726051…81383049615933440001
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
7
2^6 × origin + 1
3.707 × 10¹⁰²(103-digit number)
37070352235981452102…62766099231866880001
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
8
2^7 × origin + 1
7.414 × 10¹⁰²(103-digit number)
74140704471962904204…25532198463733760001
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
9
2^8 × origin + 1
1.482 × 10¹⁰³(104-digit number)
14828140894392580840…51064396927467520001
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
10
2^9 × origin + 1
2.965 × 10¹⁰³(104-digit number)
29656281788785161681…02128793854935040001
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,788,097 XPM·at block #6,818,003 · 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