Block #1,221,613

1CCLength 11★★★☆☆

Cunningham Chain of the First Kind · Discovered 9/4/2015, 10:44:50 AM · Difficulty 10.7413 · 5,586,416 confirmations

1CC
Cunningham Chain of the First Kind

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

Block Header
Block Hash
8d99d5af759a1d1b8db1149da50b40312e586cb0b35a5b34316d60e571e0fb13

Height

#1,221,613

Difficulty

10.741282

Transactions

5

Size

1.80 KB

Version

2

Bits

0abdc4aa

Nonce

1,444,983,604

Timestamp

9/4/2015, 10:44:50 AM

Confirmations

5,586,416

Merkle Root

dcf6880b4b4854ea7a92a7f830dc9384a21076228a3e4962484d11c634952f6a
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.

9.739 × 10⁹⁴(95-digit number)
97398489947885137657…39551622185616862399
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
9.739 × 10⁹⁴(95-digit number)
97398489947885137657…39551622185616862399
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
2
2^1 × origin − 1
1.947 × 10⁹⁵(96-digit number)
19479697989577027531…79103244371233724799
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
3
2^2 × origin − 1
3.895 × 10⁹⁵(96-digit number)
38959395979154055062…58206488742467449599
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
4
2^3 × origin − 1
7.791 × 10⁹⁵(96-digit number)
77918791958308110125…16412977484934899199
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
5
2^4 × origin − 1
1.558 × 10⁹⁶(97-digit number)
15583758391661622025…32825954969869798399
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
6
2^5 × origin − 1
3.116 × 10⁹⁶(97-digit number)
31167516783323244050…65651909939739596799
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
7
2^6 × origin − 1
6.233 × 10⁹⁶(97-digit number)
62335033566646488100…31303819879479193599
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
8
2^7 × origin − 1
1.246 × 10⁹⁷(98-digit number)
12467006713329297620…62607639758958387199
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
9
2^8 × origin − 1
2.493 × 10⁹⁷(98-digit number)
24934013426658595240…25215279517916774399
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
10
2^9 × origin − 1
4.986 × 10⁹⁷(98-digit number)
49868026853317190480…50430559035833548799
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
11
2^10 × origin − 1
9.973 × 10⁹⁷(98-digit number)
99736053706634380961…00861118071667097599
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,708,276 XPM·at block #6,808,028 · 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