Block #564,168

1CCLength 11★★★☆☆

Cunningham Chain of the First Kind · Discovered 5/27/2014, 11:24:11 AM · Difficulty 10.9647 · 6,243,923 confirmations

1CC
Cunningham Chain of the First Kind

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

Block Header
Block Hash
2259306ad820d1fa0b3b06de4c3219c87b077ef8229234774efed0b32fabfe4d

Height

#564,168

Difficulty

10.964717

Transactions

10

Size

2.65 KB

Version

2

Bits

0af6f7b6

Nonce

85,416,725

Timestamp

5/27/2014, 11:24:11 AM

Confirmations

6,243,923

Merkle Root

3ff7eed4ee51e504b42f781b571a318a74796d78526971ef61de856865a396d9
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.650 × 10⁹⁷(98-digit number)
46509843504241739624…11579263332580321919
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.650 × 10⁹⁷(98-digit number)
46509843504241739624…11579263332580321919
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
2
2^1 × origin − 1
9.301 × 10⁹⁷(98-digit number)
93019687008483479249…23158526665160643839
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
3
2^2 × origin − 1
1.860 × 10⁹⁸(99-digit number)
18603937401696695849…46317053330321287679
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
4
2^3 × origin − 1
3.720 × 10⁹⁸(99-digit number)
37207874803393391699…92634106660642575359
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
5
2^4 × origin − 1
7.441 × 10⁹⁸(99-digit number)
74415749606786783399…85268213321285150719
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
6
2^5 × origin − 1
1.488 × 10⁹⁹(100-digit number)
14883149921357356679…70536426642570301439
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
7
2^6 × origin − 1
2.976 × 10⁹⁹(100-digit number)
29766299842714713359…41072853285140602879
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
8
2^7 × origin − 1
5.953 × 10⁹⁹(100-digit number)
59532599685429426719…82145706570281205759
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
9
2^8 × origin − 1
1.190 × 10¹⁰⁰(101-digit number)
11906519937085885343…64291413140562411519
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
10
2^9 × origin − 1
2.381 × 10¹⁰⁰(101-digit number)
23813039874171770687…28582826281124823039
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
11
2^10 × origin − 1
4.762 × 10¹⁰⁰(101-digit number)
47626079748343541375…57165652562249646079
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,708,773 XPM·at block #6,808,090 · 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