Block #1,278,298

1CCLength 11★★★☆☆

Cunningham Chain of the First Kind · Discovered 10/12/2015, 7:28:19 AM · Difficulty 10.8330 · 5,536,716 confirmations

1CC
Cunningham Chain of the First Kind

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

Block Header
Block Hash
2f20b5b7976d58428148c22f108633441d484e2fd99aa71cc99cdc70382c7d6a

Height

#1,278,298

Difficulty

10.832958

Transactions

2

Size

433 B

Version

2

Bits

0ad53cbb

Nonce

1,412,743,662

Timestamp

10/12/2015, 7:28:19 AM

Confirmations

5,536,716

Merkle Root

82bcae99a1ce32168f3d867f1b426219d671cfc4773b8f8c6f567059a554041b
Transactions (2)
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.

3.363 × 10⁹⁷(98-digit number)
33634553131486852257…45916865542707425279
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
3.363 × 10⁹⁷(98-digit number)
33634553131486852257…45916865542707425279
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
2
2^1 × origin − 1
6.726 × 10⁹⁷(98-digit number)
67269106262973704515…91833731085414850559
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
3
2^2 × origin − 1
1.345 × 10⁹⁸(99-digit number)
13453821252594740903…83667462170829701119
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
4
2^3 × origin − 1
2.690 × 10⁹⁸(99-digit number)
26907642505189481806…67334924341659402239
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
5
2^4 × origin − 1
5.381 × 10⁹⁸(99-digit number)
53815285010378963612…34669848683318804479
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
6
2^5 × origin − 1
1.076 × 10⁹⁹(100-digit number)
10763057002075792722…69339697366637608959
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
7
2^6 × origin − 1
2.152 × 10⁹⁹(100-digit number)
21526114004151585444…38679394733275217919
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
8
2^7 × origin − 1
4.305 × 10⁹⁹(100-digit number)
43052228008303170889…77358789466550435839
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
9
2^8 × origin − 1
8.610 × 10⁹⁹(100-digit number)
86104456016606341779…54717578933100871679
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
10
2^9 × origin − 1
1.722 × 10¹⁰⁰(101-digit number)
17220891203321268355…09435157866201743359
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
11
2^10 × origin − 1
3.444 × 10¹⁰⁰(101-digit number)
34441782406642536711…18870315732403486719
Verify on FactorDB ↗Wolfram Alpha ↗

What this block proved

The miner who found this block proved the existence of 11 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
RareChain length 11

Approximately 1 in 1,000 blocks. Noteworthy discoveries.

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,764,201 XPM·at block #6,815,013 · 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