Block #544,062

1CCLength 11★★★☆☆

Cunningham Chain of the First Kind · Discovered 5/14/2014, 5:04:14 PM · Difficulty 10.9495 · 6,263,918 confirmations

1CC
Cunningham Chain of the First Kind

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

Block Header
Block Hash
42a24a55ce170d8bc9522d472f15fadfaf5fecaf71cac750548ca9767d60a3ed

Height

#544,062

Difficulty

10.949459

Transactions

3

Size

661 B

Version

2

Bits

0af30fb9

Nonce

39,962,672

Timestamp

5/14/2014, 5:04:14 PM

Confirmations

6,263,918

Merkle Root

6ff2e6e0ed09992c73062a9309c7aa3fcc467a1d41ada3b7586d0926f0713c9a
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.

4.641 × 10⁹⁸(99-digit number)
46410494081673695873…77689115368114817919
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
4.641 × 10⁹⁸(99-digit number)
46410494081673695873…77689115368114817919
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
2
2^1 × origin − 1
9.282 × 10⁹⁸(99-digit number)
92820988163347391746…55378230736229635839
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
3
2^2 × origin − 1
1.856 × 10⁹⁹(100-digit number)
18564197632669478349…10756461472459271679
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
4
2^3 × origin − 1
3.712 × 10⁹⁹(100-digit number)
37128395265338956698…21512922944918543359
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
5
2^4 × origin − 1
7.425 × 10⁹⁹(100-digit number)
74256790530677913396…43025845889837086719
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
6
2^5 × origin − 1
1.485 × 10¹⁰⁰(101-digit number)
14851358106135582679…86051691779674173439
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
7
2^6 × origin − 1
2.970 × 10¹⁰⁰(101-digit number)
29702716212271165358…72103383559348346879
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
8
2^7 × origin − 1
5.940 × 10¹⁰⁰(101-digit number)
59405432424542330717…44206767118696693759
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
9
2^8 × origin − 1
1.188 × 10¹⁰¹(102-digit number)
11881086484908466143…88413534237393387519
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
10
2^9 × origin − 1
2.376 × 10¹⁰¹(102-digit number)
23762172969816932287…76827068474786775039
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
11
2^10 × origin − 1
4.752 × 10¹⁰¹(102-digit number)
47524345939633864574…53654136949573550079
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 First 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 1CC formula:

1CC: p₁ (first prime), p₂ = 2p₁ + 1, p₃ = 2p₂ + 1, …
Circulating Supply:57,707,885 XPM·at block #6,807,979 · 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