Block #546,103

2CCLength 11★★★☆☆

Cunningham Chain of the Second Kind · Discovered 5/15/2014, 5:08:02 PM · Difficulty 10.9552 · 6,296,755 confirmations

2CC
Cunningham Chain of the Second Kind

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

Block Header
Block Hash
d3ab2fba8199ec6959a0e1671f6a2e8eef6c137c38ddc7c1ea568f942bd5a0e9

Height

#546,103

Difficulty

10.955189

Transactions

9

Size

2.26 KB

Version

2

Bits

0af48744

Nonce

89,797,981

Timestamp

5/15/2014, 5:08:02 PM

Confirmations

6,296,755

Merkle Root

81929af88bf22c80761afbb8921d0dae52113878f225be9758616cddd482fa48
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.

3.006 × 10⁹⁹(100-digit number)
30066212094839035205…47340155821350379521
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
3.006 × 10⁹⁹(100-digit number)
30066212094839035205…47340155821350379521
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
2
2^1 × origin + 1
6.013 × 10⁹⁹(100-digit number)
60132424189678070410…94680311642700759041
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
3
2^2 × origin + 1
1.202 × 10¹⁰⁰(101-digit number)
12026484837935614082…89360623285401518081
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
4
2^3 × origin + 1
2.405 × 10¹⁰⁰(101-digit number)
24052969675871228164…78721246570803036161
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
5
2^4 × origin + 1
4.810 × 10¹⁰⁰(101-digit number)
48105939351742456328…57442493141606072321
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
6
2^5 × origin + 1
9.621 × 10¹⁰⁰(101-digit number)
96211878703484912656…14884986283212144641
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
7
2^6 × origin + 1
1.924 × 10¹⁰¹(102-digit number)
19242375740696982531…29769972566424289281
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
8
2^7 × origin + 1
3.848 × 10¹⁰¹(102-digit number)
38484751481393965062…59539945132848578561
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
9
2^8 × origin + 1
7.696 × 10¹⁰¹(102-digit number)
76969502962787930124…19079890265697157121
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
10
2^9 × origin + 1
1.539 × 10¹⁰²(103-digit number)
15393900592557586024…38159780531394314241
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
11
2^10 × origin + 1
3.078 × 10¹⁰²(103-digit number)
30787801185115172049…76319561062788628481
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,987,211 XPM·at block #6,842,857 · 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