Block #911,316

1CCLength 10★★☆☆☆

Cunningham Chain of the First Kind · Discovered 1/27/2015, 12:26:04 AM · Difficulty 10.9313 · 5,898,338 confirmations

1CC
Cunningham Chain of the First Kind

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

Block Header
Block Hash
ac2b9d32e732420422df31a0bef01f699efa0dcfcd544103ade7e1bc0898d4b2

Height

#911,316

Difficulty

10.931279

Transactions

16

Size

6.55 KB

Version

2

Bits

0aee6848

Nonce

731,565,831

Timestamp

1/27/2015, 12:26:04 AM

Confirmations

5,898,338

Merkle Root

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

4.127 × 10⁹⁷(98-digit number)
41273173227911052021…13237256007556611839
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
4.127 × 10⁹⁷(98-digit number)
41273173227911052021…13237256007556611839
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
2
2^1 × origin − 1
8.254 × 10⁹⁷(98-digit number)
82546346455822104043…26474512015113223679
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
3
2^2 × origin − 1
1.650 × 10⁹⁸(99-digit number)
16509269291164420808…52949024030226447359
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
4
2^3 × origin − 1
3.301 × 10⁹⁸(99-digit number)
33018538582328841617…05898048060452894719
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
5
2^4 × origin − 1
6.603 × 10⁹⁸(99-digit number)
66037077164657683234…11796096120905789439
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
6
2^5 × origin − 1
1.320 × 10⁹⁹(100-digit number)
13207415432931536646…23592192241811578879
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
7
2^6 × origin − 1
2.641 × 10⁹⁹(100-digit number)
26414830865863073293…47184384483623157759
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
8
2^7 × origin − 1
5.282 × 10⁹⁹(100-digit number)
52829661731726146587…94368768967246315519
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
9
2^8 × origin − 1
1.056 × 10¹⁰⁰(101-digit number)
10565932346345229317…88737537934492631039
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
10
2^9 × origin − 1
2.113 × 10¹⁰⁰(101-digit number)
21131864692690458635…77475075868985262079
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,721,313 XPM·at block #6,809,653 · 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