Block #2,661,500

1CCLength 11★★★☆☆

Cunningham Chain of the First Kind · Discovered 5/15/2018, 4:17:37 AM · Difficulty 11.6333 · 4,169,683 confirmations

1CC
Cunningham Chain of the First Kind

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

Block Header
Block Hash
56b1ef9201efd2f610a6b69779c3aaac4378d393bcf7d99843194a5c095d2aba

Height

#2,661,500

Difficulty

11.633300

Transactions

3

Size

1.50 KB

Version

2

Bits

0ba21ff9

Nonce

1,039,173,053

Timestamp

5/15/2018, 4:17:37 AM

Confirmations

4,169,683

Merkle Root

3ad6589448a21d092ff25a92701408ab48bd0036c9b2d683739041691d81b0b5
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.542 × 10⁹³(94-digit number)
35427890361031372206…52181955440306372799
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.542 × 10⁹³(94-digit number)
35427890361031372206…52181955440306372799
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
2
2^1 × origin − 1
7.085 × 10⁹³(94-digit number)
70855780722062744413…04363910880612745599
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
3
2^2 × origin − 1
1.417 × 10⁹⁴(95-digit number)
14171156144412548882…08727821761225491199
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
4
2^3 × origin − 1
2.834 × 10⁹⁴(95-digit number)
28342312288825097765…17455643522450982399
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
5
2^4 × origin − 1
5.668 × 10⁹⁴(95-digit number)
56684624577650195530…34911287044901964799
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
6
2^5 × origin − 1
1.133 × 10⁹⁵(96-digit number)
11336924915530039106…69822574089803929599
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
7
2^6 × origin − 1
2.267 × 10⁹⁵(96-digit number)
22673849831060078212…39645148179607859199
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
8
2^7 × origin − 1
4.534 × 10⁹⁵(96-digit number)
45347699662120156424…79290296359215718399
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
9
2^8 × origin − 1
9.069 × 10⁹⁵(96-digit number)
90695399324240312849…58580592718431436799
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
10
2^9 × origin − 1
1.813 × 10⁹⁶(97-digit number)
18139079864848062569…17161185436862873599
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
11
2^10 × origin − 1
3.627 × 10⁹⁶(97-digit number)
36278159729696125139…34322370873725747199
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,893,607 XPM·at block #6,831,182 · 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