Block #317,737

1CCLength 10★★☆☆☆

Cunningham Chain of the First Kind · Discovered 12/17/2013, 9:47:34 PM · Difficulty 10.1539 · 6,508,524 confirmations

1CC
Cunningham Chain of the First Kind

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

Block Header
Block Hash
fa9b6079d2d43b88ad19696009477065fc6789dcacf091253ec13cfd28d647c1

Height

#317,737

Difficulty

10.153932

Transactions

12

Size

3.80 KB

Version

2

Bits

0a27681c

Nonce

22,880

Timestamp

12/17/2013, 9:47:34 PM

Confirmations

6,508,524

Merkle Root

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

9.533 × 10⁹⁵(96-digit number)
95330783356005063464…48290501669466058739
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
9.533 × 10⁹⁵(96-digit number)
95330783356005063464…48290501669466058739
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
2
2^1 × origin − 1
1.906 × 10⁹⁶(97-digit number)
19066156671201012692…96581003338932117479
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
3
2^2 × origin − 1
3.813 × 10⁹⁶(97-digit number)
38132313342402025385…93162006677864234959
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
4
2^3 × origin − 1
7.626 × 10⁹⁶(97-digit number)
76264626684804050771…86324013355728469919
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
5
2^4 × origin − 1
1.525 × 10⁹⁷(98-digit number)
15252925336960810154…72648026711456939839
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
6
2^5 × origin − 1
3.050 × 10⁹⁷(98-digit number)
30505850673921620308…45296053422913879679
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
7
2^6 × origin − 1
6.101 × 10⁹⁷(98-digit number)
61011701347843240616…90592106845827759359
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
8
2^7 × origin − 1
1.220 × 10⁹⁸(99-digit number)
12202340269568648123…81184213691655518719
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
9
2^8 × origin − 1
2.440 × 10⁹⁸(99-digit number)
24404680539137296246…62368427383311037439
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
10
2^9 × origin − 1
4.880 × 10⁹⁸(99-digit number)
48809361078274592493…24736854766622074879
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,854,223 XPM·at block #6,826,260 · 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