Block #315,322

2CCLength 10★★☆☆☆

Cunningham Chain of the Second Kind · Discovered 12/16/2013, 11:06:22 AM · Difficulty 10.0949 · 6,492,480 confirmations

2CC
Cunningham Chain of the Second Kind

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

Block Header
Block Hash
83d10cee98e1ccf098ea4e22cf433208db397a6559695d73d280e559509d1158

Height

#315,322

Difficulty

10.094889

Transactions

1

Size

1004 B

Version

2

Bits

0a184aa7

Nonce

60,503

Timestamp

12/16/2013, 11:06:22 AM

Confirmations

6,492,480

Merkle Root

d6cdcd63a2aa4af7dd27cb65f89eb658a3936ff2fb76546930f5c4beaecd67b3
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.303 × 10⁹⁷(98-digit number)
73030166919202622888…50600018381174178561
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.303 × 10⁹⁷(98-digit number)
73030166919202622888…50600018381174178561
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
2
2^1 × origin + 1
1.460 × 10⁹⁸(99-digit number)
14606033383840524577…01200036762348357121
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
3
2^2 × origin + 1
2.921 × 10⁹⁸(99-digit number)
29212066767681049155…02400073524696714241
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
4
2^3 × origin + 1
5.842 × 10⁹⁸(99-digit number)
58424133535362098310…04800147049393428481
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
5
2^4 × origin + 1
1.168 × 10⁹⁹(100-digit number)
11684826707072419662…09600294098786856961
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
6
2^5 × origin + 1
2.336 × 10⁹⁹(100-digit number)
23369653414144839324…19200588197573713921
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
7
2^6 × origin + 1
4.673 × 10⁹⁹(100-digit number)
46739306828289678648…38401176395147427841
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
8
2^7 × origin + 1
9.347 × 10⁹⁹(100-digit number)
93478613656579357296…76802352790294855681
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
9
2^8 × origin + 1
1.869 × 10¹⁰⁰(101-digit number)
18695722731315871459…53604705580589711361
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
10
2^9 × origin + 1
3.739 × 10¹⁰⁰(101-digit number)
37391445462631742918…07209411161179422721
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,706,450 XPM·at block #6,807,801 · 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