Block #282,215

1CCLength 10★★☆☆☆

Cunningham Chain of the First Kind · Discovered 11/29/2013, 7:37:58 AM · Difficulty 9.9786 · 6,525,966 confirmations

1CC
Cunningham Chain of the First Kind

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

Block Header
Block Hash
a728e82d39f16e916c16f7c9806e201283a94186f214ea2f14126457c03bd683

Height

#282,215

Difficulty

9.978649

Transactions

11

Size

2.87 KB

Version

2

Bits

09fa88bf

Nonce

4,992

Timestamp

11/29/2013, 7:37:58 AM

Confirmations

6,525,966

Merkle Root

25ea521e87000a90ad52e8c34537aa90f97707c74b2416f1b1c61feab9c0a7bd
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.909 × 10¹⁰³(104-digit number)
19090997535951528979…09595559305939814879
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.909 × 10¹⁰³(104-digit number)
19090997535951528979…09595559305939814879
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
2
2^1 × origin − 1
3.818 × 10¹⁰³(104-digit number)
38181995071903057959…19191118611879629759
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
3
2^2 × origin − 1
7.636 × 10¹⁰³(104-digit number)
76363990143806115918…38382237223759259519
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
4
2^3 × origin − 1
1.527 × 10¹⁰⁴(105-digit number)
15272798028761223183…76764474447518519039
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
5
2^4 × origin − 1
3.054 × 10¹⁰⁴(105-digit number)
30545596057522446367…53528948895037038079
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
6
2^5 × origin − 1
6.109 × 10¹⁰⁴(105-digit number)
61091192115044892734…07057897790074076159
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
7
2^6 × origin − 1
1.221 × 10¹⁰⁵(106-digit number)
12218238423008978546…14115795580148152319
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
8
2^7 × origin − 1
2.443 × 10¹⁰⁵(106-digit number)
24436476846017957093…28231591160296304639
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
9
2^8 × origin − 1
4.887 × 10¹⁰⁵(106-digit number)
48872953692035914187…56463182320592609279
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
10
2^9 × origin − 1
9.774 × 10¹⁰⁵(106-digit number)
97745907384071828375…12926364641185218559
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,709,497 XPM·at block #6,808,180 · 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