Block #2,169,795

1CCLength 11★★★☆☆

Cunningham Chain of the First Kind · Discovered 6/21/2017, 3:25:21 AM · Difficulty 10.9006 · 4,672,790 confirmations

1CC
Cunningham Chain of the First Kind

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

Block Header
Block Hash
45df71276849a8442185cd02f873d5b4d2f344cac6aeb16e2188546648ed60c1

Height

#2,169,795

Difficulty

10.900632

Transactions

3

Size

1.94 KB

Version

2

Bits

0ae68fce

Nonce

181,705,297

Timestamp

6/21/2017, 3:25:21 AM

Confirmations

4,672,790

Merkle Root

fe94fc95819b7b415e5d8c4162e69f30312248f062e2f7b40bfd7bc4c9d184ca
Transactions (3)
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.152 × 10⁹⁴(95-digit number)
31522101642128645254…56607705314211906559
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.152 × 10⁹⁴(95-digit number)
31522101642128645254…56607705314211906559
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
2
2^1 × origin − 1
6.304 × 10⁹⁴(95-digit number)
63044203284257290508…13215410628423813119
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
3
2^2 × origin − 1
1.260 × 10⁹⁵(96-digit number)
12608840656851458101…26430821256847626239
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
4
2^3 × origin − 1
2.521 × 10⁹⁵(96-digit number)
25217681313702916203…52861642513695252479
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
5
2^4 × origin − 1
5.043 × 10⁹⁵(96-digit number)
50435362627405832406…05723285027390504959
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
6
2^5 × origin − 1
1.008 × 10⁹⁶(97-digit number)
10087072525481166481…11446570054781009919
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
7
2^6 × origin − 1
2.017 × 10⁹⁶(97-digit number)
20174145050962332962…22893140109562019839
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
8
2^7 × origin − 1
4.034 × 10⁹⁶(97-digit number)
40348290101924665925…45786280219124039679
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
9
2^8 × origin − 1
8.069 × 10⁹⁶(97-digit number)
80696580203849331850…91572560438248079359
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
10
2^9 × origin − 1
1.613 × 10⁹⁷(98-digit number)
16139316040769866370…83145120876496158719
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
11
2^10 × origin − 1
3.227 × 10⁹⁷(98-digit number)
32278632081539732740…66290241752992317439
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,985,109 XPM·at block #6,842,584 · 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