Block #315,754

1CCLength 10★★☆☆☆

Cunningham Chain of the First Kind · Discovered 12/16/2013, 4:34:07 PM · Difficulty 10.1136 · 6,509,561 confirmations

1CC
Cunningham Chain of the First Kind

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

Block Header
Block Hash
a32bba402035fe447aaa023c7dab8e83e6bba72564ad473197b584c7331771ea

Height

#315,754

Difficulty

10.113568

Transactions

1

Size

1.04 KB

Version

2

Bits

0a1d12c9

Nonce

257,811

Timestamp

12/16/2013, 4:34:07 PM

Confirmations

6,509,561

Merkle Root

8cd7ed80b68290fcf2290e9f99bdabf8da9cbf77929f8b4951b103da5da37308
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.552 × 10⁹²(93-digit number)
15521256591514782867…14836757276878352959
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.552 × 10⁹²(93-digit number)
15521256591514782867…14836757276878352959
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
2
2^1 × origin − 1
3.104 × 10⁹²(93-digit number)
31042513183029565735…29673514553756705919
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
3
2^2 × origin − 1
6.208 × 10⁹²(93-digit number)
62085026366059131471…59347029107513411839
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
4
2^3 × origin − 1
1.241 × 10⁹³(94-digit number)
12417005273211826294…18694058215026823679
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
5
2^4 × origin − 1
2.483 × 10⁹³(94-digit number)
24834010546423652588…37388116430053647359
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
6
2^5 × origin − 1
4.966 × 10⁹³(94-digit number)
49668021092847305176…74776232860107294719
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
7
2^6 × origin − 1
9.933 × 10⁹³(94-digit number)
99336042185694610353…49552465720214589439
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
8
2^7 × origin − 1
1.986 × 10⁹⁴(95-digit number)
19867208437138922070…99104931440429178879
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
9
2^8 × origin − 1
3.973 × 10⁹⁴(95-digit number)
39734416874277844141…98209862880858357759
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
10
2^9 × origin − 1
7.946 × 10⁹⁴(95-digit number)
79468833748555688282…96419725761716715519
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,846,624 XPM·at block #6,825,314 · 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