Block #913,311

2CCLength 10★★☆☆☆

Cunningham Chain of the Second Kind · Discovered 1/28/2015, 2:02:21 PM · Difficulty 10.9277 · 5,894,751 confirmations

2CC
Cunningham Chain of the Second Kind

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

Block Header
Block Hash
9cdb41424709066572fd0cf733f4e9156e33e293969a8e03710c5ef654a371bb

Height

#913,311

Difficulty

10.927698

Transactions

10

Size

1.95 KB

Version

2

Bits

0aed7d9c

Nonce

594,933,869

Timestamp

1/28/2015, 2:02:21 PM

Confirmations

5,894,751

Merkle Root

8a98520a952e4dd675f429063a4306b3b241608d1b94685e8d19a3b8fd0ecec2
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.482 × 10⁹⁷(98-digit number)
14821917702300987157…81595690226615468801
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.482 × 10⁹⁷(98-digit number)
14821917702300987157…81595690226615468801
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
2
2^1 × origin + 1
2.964 × 10⁹⁷(98-digit number)
29643835404601974315…63191380453230937601
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
3
2^2 × origin + 1
5.928 × 10⁹⁷(98-digit number)
59287670809203948630…26382760906461875201
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
4
2^3 × origin + 1
1.185 × 10⁹⁸(99-digit number)
11857534161840789726…52765521812923750401
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
5
2^4 × origin + 1
2.371 × 10⁹⁸(99-digit number)
23715068323681579452…05531043625847500801
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
6
2^5 × origin + 1
4.743 × 10⁹⁸(99-digit number)
47430136647363158904…11062087251695001601
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
7
2^6 × origin + 1
9.486 × 10⁹⁸(99-digit number)
94860273294726317808…22124174503390003201
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
8
2^7 × origin + 1
1.897 × 10⁹⁹(100-digit number)
18972054658945263561…44248349006780006401
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
9
2^8 × origin + 1
3.794 × 10⁹⁹(100-digit number)
37944109317890527123…88496698013560012801
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
10
2^9 × origin + 1
7.588 × 10⁹⁹(100-digit number)
75888218635781054246…76993396027120025601
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,708,540 XPM·at block #6,808,061 · 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