Block #317,348

1CCLength 10★★☆☆☆

Cunningham Chain of the First Kind · Discovered 12/17/2013, 3:07:05 PM · Difficulty 10.1554 · 6,498,905 confirmations

1CC
Cunningham Chain of the First Kind

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

Block Header
Block Hash
2313ca3e5053c67a07b086b76ec3126b42ad82fa8f0a458b6eebbb12a356c978

Height

#317,348

Difficulty

10.155443

Transactions

6

Size

1.59 KB

Version

2

Bits

0a27cb15

Nonce

334

Timestamp

12/17/2013, 3:07:05 PM

Confirmations

6,498,905

Merkle Root

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

2.115 × 10⁹⁶(97-digit number)
21159593480537427773…34007805180862610439
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
2.115 × 10⁹⁶(97-digit number)
21159593480537427773…34007805180862610439
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
2
2^1 × origin − 1
4.231 × 10⁹⁶(97-digit number)
42319186961074855547…68015610361725220879
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
3
2^2 × origin − 1
8.463 × 10⁹⁶(97-digit number)
84638373922149711094…36031220723450441759
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
4
2^3 × origin − 1
1.692 × 10⁹⁷(98-digit number)
16927674784429942218…72062441446900883519
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
5
2^4 × origin − 1
3.385 × 10⁹⁷(98-digit number)
33855349568859884437…44124882893801767039
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
6
2^5 × origin − 1
6.771 × 10⁹⁷(98-digit number)
67710699137719768875…88249765787603534079
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
7
2^6 × origin − 1
1.354 × 10⁹⁸(99-digit number)
13542139827543953775…76499531575207068159
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
8
2^7 × origin − 1
2.708 × 10⁹⁸(99-digit number)
27084279655087907550…52999063150414136319
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
9
2^8 × origin − 1
5.416 × 10⁹⁸(99-digit number)
54168559310175815100…05998126300828272639
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
10
2^9 × origin − 1
1.083 × 10⁹⁹(100-digit number)
10833711862035163020…11996252601656545279
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 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
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 1CC formula:

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