Block #278,817

1CCLength 10★★☆☆☆

Cunningham Chain of the First Kind · Discovered 11/28/2013, 3:18:46 AM · Difficulty 9.9700 · 6,552,177 confirmations

1CC
Cunningham Chain of the First Kind

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

Block Header
Block Hash
ffe2ac9e408071593e115453b6aec64ef02e5115132988c2bb46459d50cd370f

Height

#278,817

Difficulty

9.969971

Transactions

5

Size

6.17 KB

Version

2

Bits

09f8500b

Nonce

14,736

Timestamp

11/28/2013, 3:18:46 AM

Confirmations

6,552,177

Merkle Root

c8850b73345557bdfdf59d676044bd2278b2b6e6c0e0d3618073ae967f2bb470
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.665 × 10¹⁰²(103-digit number)
76658839038989168135…02857490901480127949
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.665 × 10¹⁰²(103-digit number)
76658839038989168135…02857490901480127949
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
2
2^1 × origin − 1
1.533 × 10¹⁰³(104-digit number)
15331767807797833627…05714981802960255899
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
3
2^2 × origin − 1
3.066 × 10¹⁰³(104-digit number)
30663535615595667254…11429963605920511799
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
4
2^3 × origin − 1
6.132 × 10¹⁰³(104-digit number)
61327071231191334508…22859927211841023599
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
5
2^4 × origin − 1
1.226 × 10¹⁰⁴(105-digit number)
12265414246238266901…45719854423682047199
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
6
2^5 × origin − 1
2.453 × 10¹⁰⁴(105-digit number)
24530828492476533803…91439708847364094399
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
7
2^6 × origin − 1
4.906 × 10¹⁰⁴(105-digit number)
49061656984953067606…82879417694728188799
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
8
2^7 × origin − 1
9.812 × 10¹⁰⁴(105-digit number)
98123313969906135213…65758835389456377599
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
9
2^8 × origin − 1
1.962 × 10¹⁰⁵(106-digit number)
19624662793981227042…31517670778912755199
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
10
2^9 × origin − 1
3.924 × 10¹⁰⁵(106-digit number)
39249325587962454085…63035341557825510399
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,892,093 XPM·at block #6,830,993 · 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