Block #1,380,534

1CCLength 10★★☆☆☆

Cunningham Chain of the First Kind · Discovered 12/22/2015, 8:36:45 PM · Difficulty 10.8091 · 5,427,775 confirmations

1CC
Cunningham Chain of the First Kind

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

Block Header
Block Hash
63b27a8e5cd92ae4a4e2b40e3613806b3241a736b470eb36ad2130bddac89850

Height

#1,380,534

Difficulty

10.809064

Transactions

3

Size

3.89 KB

Version

2

Bits

0acf1ed1

Nonce

498,184,885

Timestamp

12/22/2015, 8:36:45 PM

Confirmations

5,427,775

Merkle Root

9aa46666cc07b26bf2ef5cf6124692819ef626d2e1b6386db2dd744aa923797e
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.333 × 10⁹⁷(98-digit number)
13330902247892310623…71892535436451307519
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.333 × 10⁹⁷(98-digit number)
13330902247892310623…71892535436451307519
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
2
2^1 × origin − 1
2.666 × 10⁹⁷(98-digit number)
26661804495784621246…43785070872902615039
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
3
2^2 × origin − 1
5.332 × 10⁹⁷(98-digit number)
53323608991569242492…87570141745805230079
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
4
2^3 × origin − 1
1.066 × 10⁹⁸(99-digit number)
10664721798313848498…75140283491610460159
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
5
2^4 × origin − 1
2.132 × 10⁹⁸(99-digit number)
21329443596627696997…50280566983220920319
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
6
2^5 × origin − 1
4.265 × 10⁹⁸(99-digit number)
42658887193255393994…00561133966441840639
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
7
2^6 × origin − 1
8.531 × 10⁹⁸(99-digit number)
85317774386510787988…01122267932883681279
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
8
2^7 × origin − 1
1.706 × 10⁹⁹(100-digit number)
17063554877302157597…02244535865767362559
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
9
2^8 × origin − 1
3.412 × 10⁹⁹(100-digit number)
34127109754604315195…04489071731534725119
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
10
2^9 × origin − 1
6.825 × 10⁹⁹(100-digit number)
68254219509208630390…08978143463069450239
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,710,527 XPM·at block #6,808,308 · 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