Block #2,269,766

1CCLength 11★★★☆☆

Cunningham Chain of the First Kind · Discovered 8/27/2017, 4:20:13 AM · Difficulty 10.9525 · 4,572,089 confirmations

1CC
Cunningham Chain of the First Kind

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

Block Header
Block Hash
f3ceb43ded0d6221ab9e14a04b0969a1d74231d1366e5cbd413500cb2443e77a

Height

#2,269,766

Difficulty

10.952489

Transactions

2

Size

721 B

Version

2

Bits

0af3d64e

Nonce

1,470,020,903

Timestamp

8/27/2017, 4:20:13 AM

Confirmations

4,572,089

Merkle Root

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

6.863 × 10⁹⁴(95-digit number)
68633546147736852603…84804710118478496319
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
6.863 × 10⁹⁴(95-digit number)
68633546147736852603…84804710118478496319
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
2
2^1 × origin − 1
1.372 × 10⁹⁵(96-digit number)
13726709229547370520…69609420236956992639
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
3
2^2 × origin − 1
2.745 × 10⁹⁵(96-digit number)
27453418459094741041…39218840473913985279
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
4
2^3 × origin − 1
5.490 × 10⁹⁵(96-digit number)
54906836918189482082…78437680947827970559
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
5
2^4 × origin − 1
1.098 × 10⁹⁶(97-digit number)
10981367383637896416…56875361895655941119
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
6
2^5 × origin − 1
2.196 × 10⁹⁶(97-digit number)
21962734767275792833…13750723791311882239
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
7
2^6 × origin − 1
4.392 × 10⁹⁶(97-digit number)
43925469534551585666…27501447582623764479
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
8
2^7 × origin − 1
8.785 × 10⁹⁶(97-digit number)
87850939069103171332…55002895165247528959
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
9
2^8 × origin − 1
1.757 × 10⁹⁷(98-digit number)
17570187813820634266…10005790330495057919
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
10
2^9 × origin − 1
3.514 × 10⁹⁷(98-digit number)
35140375627641268532…20011580660990115839
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
11
2^10 × origin − 1
7.028 × 10⁹⁷(98-digit number)
70280751255282537065…40023161321980231679
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,979,216 XPM·at block #6,841,854 · 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