Block #557,006

1CCLength 11★★★☆☆

Cunningham Chain of the First Kind · Discovered 5/22/2014, 4:09:05 PM · Difficulty 10.9627 · 6,253,825 confirmations

1CC
Cunningham Chain of the First Kind

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

Block Header
Block Hash
0150a9355e5b7024bd67534b50f7859acca4e1adc8d02deb882061731bfb607d

Height

#557,006

Difficulty

10.962712

Transactions

6

Size

1.59 KB

Version

2

Bits

0af6744a

Nonce

765,205,546

Timestamp

5/22/2014, 4:09:05 PM

Confirmations

6,253,825

Merkle Root

0efa8c610aa7725bc962010c95c9740814324f1087725b2cc4ccc154d1cb28fa
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.

7.691 × 10⁹⁹(100-digit number)
76911823976035210810…09074688101112463999
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
7.691 × 10⁹⁹(100-digit number)
76911823976035210810…09074688101112463999
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
2
2^1 × origin − 1
1.538 × 10¹⁰⁰(101-digit number)
15382364795207042162…18149376202224927999
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
3
2^2 × origin − 1
3.076 × 10¹⁰⁰(101-digit number)
30764729590414084324…36298752404449855999
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
4
2^3 × origin − 1
6.152 × 10¹⁰⁰(101-digit number)
61529459180828168648…72597504808899711999
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
5
2^4 × origin − 1
1.230 × 10¹⁰¹(102-digit number)
12305891836165633729…45195009617799423999
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
6
2^5 × origin − 1
2.461 × 10¹⁰¹(102-digit number)
24611783672331267459…90390019235598847999
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
7
2^6 × origin − 1
4.922 × 10¹⁰¹(102-digit number)
49223567344662534918…80780038471197695999
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
8
2^7 × origin − 1
9.844 × 10¹⁰¹(102-digit number)
98447134689325069837…61560076942395391999
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
9
2^8 × origin − 1
1.968 × 10¹⁰²(103-digit number)
19689426937865013967…23120153884790783999
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
10
2^9 × origin − 1
3.937 × 10¹⁰²(103-digit number)
39378853875730027934…46240307769581567999
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
11
2^10 × origin − 1
7.875 × 10¹⁰²(103-digit number)
78757707751460055869…92480615539163135999
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,730,743 XPM·at block #6,810,830 · 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