Block #674,092

2CCLength 11★★★☆☆

Cunningham Chain of the Second Kind · Discovered 8/12/2014, 12:46:28 AM · Difficulty 10.9653 · 6,133,812 confirmations

2CC
Cunningham Chain of the Second Kind

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

Block Header
Block Hash
22016e6c39c9b5d92d44c4539a5a2f51b4107233c52df047b641430886fbe775

Height

#674,092

Difficulty

10.965287

Transactions

4

Size

885 B

Version

2

Bits

0af71d0a

Nonce

851,118,001

Timestamp

8/12/2014, 12:46:28 AM

Confirmations

6,133,812

Merkle Root

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

1.183 × 10⁹⁷(98-digit number)
11839975968537297341…04120454580450201601
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
1.183 × 10⁹⁷(98-digit number)
11839975968537297341…04120454580450201601
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
2
2^1 × origin + 1
2.367 × 10⁹⁷(98-digit number)
23679951937074594683…08240909160900403201
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
3
2^2 × origin + 1
4.735 × 10⁹⁷(98-digit number)
47359903874149189367…16481818321800806401
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
4
2^3 × origin + 1
9.471 × 10⁹⁷(98-digit number)
94719807748298378734…32963636643601612801
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
5
2^4 × origin + 1
1.894 × 10⁹⁸(99-digit number)
18943961549659675746…65927273287203225601
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
6
2^5 × origin + 1
3.788 × 10⁹⁸(99-digit number)
37887923099319351493…31854546574406451201
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
7
2^6 × origin + 1
7.577 × 10⁹⁸(99-digit number)
75775846198638702987…63709093148812902401
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
8
2^7 × origin + 1
1.515 × 10⁹⁹(100-digit number)
15155169239727740597…27418186297625804801
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
9
2^8 × origin + 1
3.031 × 10⁹⁹(100-digit number)
30310338479455481195…54836372595251609601
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
10
2^9 × origin + 1
6.062 × 10⁹⁹(100-digit number)
60620676958910962390…09672745190503219201
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
11
2^10 × origin + 1
1.212 × 10¹⁰⁰(101-digit number)
12124135391782192478…19345490381006438401
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 Second 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 2CC formula:

2CC: p₁ (first prime), p₂ = 2p₁ − 1, p₃ = 2p₂ − 1, …
Circulating Supply:57,707,265 XPM·at block #6,807,903 · 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