Block #327,884

2CCLength 10★★☆☆☆

Cunningham Chain of the Second Kind · Discovered 12/24/2013, 9:28:24 PM · Difficulty 10.1707 · 6,486,968 confirmations

2CC
Cunningham Chain of the Second Kind

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

Block Header
Block Hash
4615e417a3bd336d313a4ee0bd63ede056ecfe8f3475a969c143ad48594393a6

Height

#327,884

Difficulty

10.170712

Transactions

8

Size

2.68 KB

Version

2

Bits

0a2bb3c7

Nonce

356

Timestamp

12/24/2013, 9:28:24 PM

Confirmations

6,486,968

Merkle Root

acd98d1e7392e38609f619078d459e4a91866c65356cc079c00ab624eb0de7ad
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.

8.384 × 10⁹⁸(99-digit number)
83840751637143090914…95324045818506008641
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
8.384 × 10⁹⁸(99-digit number)
83840751637143090914…95324045818506008641
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
2
2^1 × origin + 1
1.676 × 10⁹⁹(100-digit number)
16768150327428618182…90648091637012017281
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
3
2^2 × origin + 1
3.353 × 10⁹⁹(100-digit number)
33536300654857236365…81296183274024034561
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
4
2^3 × origin + 1
6.707 × 10⁹⁹(100-digit number)
67072601309714472731…62592366548048069121
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
5
2^4 × origin + 1
1.341 × 10¹⁰⁰(101-digit number)
13414520261942894546…25184733096096138241
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
6
2^5 × origin + 1
2.682 × 10¹⁰⁰(101-digit number)
26829040523885789092…50369466192192276481
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
7
2^6 × origin + 1
5.365 × 10¹⁰⁰(101-digit number)
53658081047771578185…00738932384384552961
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
8
2^7 × origin + 1
1.073 × 10¹⁰¹(102-digit number)
10731616209554315637…01477864768769105921
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
9
2^8 × origin + 1
2.146 × 10¹⁰¹(102-digit number)
21463232419108631274…02955729537538211841
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
10
2^9 × origin + 1
4.292 × 10¹⁰¹(102-digit number)
42926464838217262548…05911459075076423681
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,762,899 XPM·at block #6,814,851 · 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