Block #449,773

2CCLength 10★★☆☆☆

Cunningham Chain of the Second Kind · Discovered 3/18/2014, 7:51:24 PM · Difficulty 10.3733 · 6,360,304 confirmations

2CC
Cunningham Chain of the Second Kind

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

Block Header
Block Hash
023f5f35b1b4b7e1927ebd275b5e950121589eaa8478b7569f71a8fed39259bb

Height

#449,773

Difficulty

10.373338

Transactions

8

Size

2.55 KB

Version

2

Bits

0a5f931a

Nonce

3,554

Timestamp

3/18/2014, 7:51:24 PM

Confirmations

6,360,304

Merkle Root

783d0ef9492f50603a443ed6a0163375fc95ac80a9391eab2a80c6873547d51c
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.201 × 10¹⁰²(103-digit number)
12011047781451600684…90936759138161861121
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.201 × 10¹⁰²(103-digit number)
12011047781451600684…90936759138161861121
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
2
2^1 × origin + 1
2.402 × 10¹⁰²(103-digit number)
24022095562903201369…81873518276323722241
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
3
2^2 × origin + 1
4.804 × 10¹⁰²(103-digit number)
48044191125806402738…63747036552647444481
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
4
2^3 × origin + 1
9.608 × 10¹⁰²(103-digit number)
96088382251612805476…27494073105294888961
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
5
2^4 × origin + 1
1.921 × 10¹⁰³(104-digit number)
19217676450322561095…54988146210589777921
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
6
2^5 × origin + 1
3.843 × 10¹⁰³(104-digit number)
38435352900645122190…09976292421179555841
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
7
2^6 × origin + 1
7.687 × 10¹⁰³(104-digit number)
76870705801290244381…19952584842359111681
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
8
2^7 × origin + 1
1.537 × 10¹⁰⁴(105-digit number)
15374141160258048876…39905169684718223361
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
9
2^8 × origin + 1
3.074 × 10¹⁰⁴(105-digit number)
30748282320516097752…79810339369436446721
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
10
2^9 × origin + 1
6.149 × 10¹⁰⁴(105-digit number)
61496564641032195505…59620678738872893441
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,724,687 XPM·at block #6,810,076 · 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